Sciweavers

2487 search results - page 397 / 498
» Partitions of Graphs into Trees
Sort
View
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 8 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
14 years 8 days ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 8 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...
CVPR
2004
IEEE
14 years 10 months ago
Tracking Loose-Limbed People
We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loos...
Leonid Sigal, Sidharth Bhatia, Stefan Roth, Michae...
RSS
2007
147views Robotics» more  RSS 2007»
13 years 9 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