829 search results - page 114 / 166 » Distance domination-critical graphs |
102
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
ICDE
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
ADHOCNOW
2007
Springer
15 years 6 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
116
click to vote
MM
2004
ACM
15 years 5 months ago
2004
ACM
This paper deals with phrase structure detection in contemporary western dance. Phrases are a sequence of movements that exist at semantic abstraction than gestures. The problem i...
116
click to vote
BMCBI
2011
14 years 3 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...