Sciweavers

672 search results - page 31 / 135
» Lower-stretch spanning trees
Sort
View
VTC
2010
IEEE
178views Communications» more  VTC 2010»
13 years 6 months ago
Nonparametric Belief Propagation Based on Spanning Trees for Cooperative Localization in Wireless Sensor Networks
—Nonparametric belief propagation (NBP) is one of the best-known methods for cooperative localization in sensor networks. It is capable to provide information about location esti...
Vladimir Savic, Santiago Zazo
EGH
2009
Springer
13 years 5 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
3DPVT
2006
IEEE
170views Visualization» more  3DPVT 2006»
14 years 1 months ago
Minimum Spanning Tree Pose Estimation
The extrinsic camera parameters from video stream images can be accurately estimated by tracking features through the image sequence and using these features to compute parameter ...
Kevin L. Steele, Parris K. Egbert
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
11 years 10 months ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
TCAD
2008
128views more  TCAD 2008»
13 years 7 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...