Sciweavers

3875 search results - page 653 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
16 years 4 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
FOCS
2000
IEEE
15 years 8 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
ECML
2006
Springer
15 years 8 months ago
Task-Driven Discretization of the Joint Space of Visual Percepts and Continuous Actions
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
Sébastien Jodogne, Justus H. Piater
IJRR
2006
88views more  IJRR 2006»
15 years 4 months ago
Multi-robot Simultaneous Localization and Mapping using Particle Filters
Abstract-- This paper describes an on-line algorithm for multirobot simultaneous localization and mapping (SLAM). We take as our starting point the single-robot Rao-Blackwellized p...
Andrew Howard
JEA
2006
83views more  JEA 2006»
15 years 4 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna