Sciweavers

649 search results - page 106 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
RSS
2007
147views Robotics» more  RSS 2007»
13 years 10 months ago
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
STOC
1997
ACM
97views Algorithms» more  STOC 1997»
14 years 1 months ago
Using and Combining Predictors That Specialize
Abstract. We study online learning algorithms that predict by combining the predictions of several subordinate prediction algorithms, sometimes called “experts.” These simple a...
Yoav Freund, Robert E. Schapire, Yoram Singer, Man...
ICCV
2001
IEEE
14 years 10 months ago
Image Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
Song Wang, Jeffrey Mark Siskind
CVPR
2007
IEEE
14 years 11 months ago
Image Matching via Saliency Region Correspondences
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
Alexander Toshev, Jianbo Shi, Kostas Daniilidis