Sciweavers

271 search results - page 17 / 55
» Quasi-isometries between graphs and trees
Sort
View
TPDS
2008
136views more  TPDS 2008»
15 years 6 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
CVPR
2010
IEEE
16 years 2 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
16 years 24 days ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
GBRPR
2009
Springer
15 years 10 months ago
Homeomorphic Alignment of Edge-Weighted Trees
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
Benjamin Raynal, Michel Couprie, Venceslas Biri
INFOVIS
2005
IEEE
16 years 8 days ago
Interactive Visualization of Genealogical Graphs
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...
Michael J. McGuffin, Ravin Balakrishnan