Sciweavers

2188 search results - page 313 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
ECCV
2008
Springer
15 years 4 months ago
Active Matching
Abstract. In the matching tasks which form an integral part of all types of tracking and geometrical vision, there are invariably priors available on the absolute and/or relative i...
Margarita Chli, Andrew J. Davison
SIROCCO
2008
15 years 4 months ago
Fast Radio Broadcasting with Advice
We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between t...
David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
RSS
2007
119views Robotics» more  RSS 2007»
15 years 4 months ago
BS-SLAM: Shaping the World
— This paper presents BS-SLAM, a simultaneous localization and mapping algorithm for use in unstructured environments that is effective regardless of whether features correspond ...
Luis Pedraza, Gamini Dissanayake, Jaime Valls Mir&...
DAGSTUHL
2004
15 years 4 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 4 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...