Sciweavers

477 search results - page 30 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
ADG
2004
Springer
189views Mathematics» more  ADG 2004»
15 years 3 months ago
nD Polyhedral Scene Reconstruction from Single 2D Line Drawing by Local Propagation
In this paper, we study the problem of reconstructing the polyhedral structures and geometric positions of a general nD polyhedral scene from a single 2D line drawing. With the ide...
Hongbo Li
ECCC
2007
180views more  ECCC 2007»
14 years 10 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
15 years 3 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ï¬...
Filippo Geraci, Roberto Grossi
FOCS
2000
IEEE
15 years 2 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
15 years 3 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...