Sciweavers

5169 search results - page 140 / 1034
» Locality approximation using time
Sort
View
IROS
2007
IEEE
119views Robotics» more  IROS 2007»
15 years 11 months ago
Scalable SLAM building conditionally independent local maps
— Local maps algorithms have demonstrated to be well suited for mapping large environments as can reduce the computational cost and improve the consistency of the final estimati...
Pedro Pinies, Juan D. Tardós
TON
2002
86views more  TON 2002»
15 years 4 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
AAAI
1997
15 years 6 months ago
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
Frank Klassner, Victor R. Lesser, Hamid Nawab
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
15 years 4 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
FOCS
2008
IEEE
15 years 11 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...