420 search results - page 11 / 84 » Search on High Degree Graphs |
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
ACG
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
CPM
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...