Sciweavers

27 search results - page 6 / 6
» Compact Ancestry Labeling Schemes for XML Trees
Sort
View
INFOCOM
2009
IEEE
13 years 12 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
ICDM
2006
IEEE
110views Data Mining» more  ICDM 2006»
13 years 11 months ago
Manifold Clustering of Shapes
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
Dragomir Yankov, Eamonn J. Keogh