3068 search results - page 174 / 614 » Clustering with Multiple Graphs |
154
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
126
Voted
EUROPAR
1999
Springer
15 years 8 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
127
click to vote
JGT
2007
15 years 3 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
138
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
143
click to vote
SIROCCO
2008
15 years 5 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...