搜索结果: 1-6 共查到“信息科学与系统科学 Generalization”相关记录6条 . 查询时间(0.146 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Robust Generalization Requires Exponentially Large Models
鲁棒泛化 指数级大 模型
font style='font-size:12px;'>
2023/5/15
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Generalization of Graph Neural Networks and Graph Structural Learning for Robust Representation
图神经网络 泛化 图结构学习 鲁棒表示
font style='font-size:12px;'>
2023/4/18
Rendering Effective Route Maps: Improving Usability Through Generalization
Information Visualization Non-Realistic Rendering WWW Applications, Human Factors
font style='font-size:12px;'>
2016/5/24
Route maps, which depict a path from one location to another, have
emerged as one of the most popular applications on the Web. Current
computer-generated route maps, however, are often very diffi-
...
A NEW GENERALIZATION OF ORE'S THEOREM INVOLVING NEIGHBORHOOD UNIONS
font style='font-size:12px;'>
2007/8/7
Let G be a 2-connected simple graph of order n. In this paper we prove the following generalization of Ore's theorem: If G is a 2-connected graph such that |N(u) \cup N(v)|+|N(u) \cup N(w)| ≥ n for ev...
A FURTHER GENERALIZATION OF JUNG'S THEOREM
Neighborhood unions 1-tough graph Hamilt
font style='font-size:12px;'>
2007/8/7
l. By c(G) we denote the length of the longest cycle in G; in particular, G is called a Hamiltonian graph if c(G)=n. H.A. Jung proved that every 1-tough graph with order n≥11 and σ2≥n-4 is Hamiltonian...
A GENERALIZATION OF THE n-QUEEN PROBLEM
Chessboard covering n-queen problem c
font style='font-size:12px;'>
2007/8/7
A generalization of the well-known n-queen problem is to put N×k‘queens’on an k×n chessboard in such a way that each row and each column contains exactly k‘queens’and each diagonal with length from 1 ...