537 search results - page 59 / 108 » A Call to Regularity |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
IJCAI
1997
13 years 9 months ago
1997
Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
DM
2008
13 years 7 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
TOG
2002
13 years 7 months ago
2002
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, whi...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
A large amount of information on the Web is contained in regularly structured objects, which we call data records. Such data records are important because they often present the e...