1664 search results - page 189 / 333 » Distance labeling in graphs |
195
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
In the context of variational image segmentation, we propose a new finite-dimensional implicit surface representation. The key idea is to span a subset of implicit functions with ...
191
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
176
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
171
click to vote
ISMIR
2004
Springer
15 years 12 months ago
2004
Springer
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
156
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...