Sciweavers

2526 search results - page 146 / 506
» A New Algorithm for Answer Set Computation
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 6 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
269
Voted
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 7 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
CVPR
2007
IEEE
16 years 8 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
CCCG
2006
15 years 7 months ago
On the Smallest Enclosing Information Disk
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
Frank Nielsen, Richard Nock
AAAI
2000
15 years 7 months ago
Performance Comparison of Landmark Recognition Systems for Navigating Mobile Robots
Self-localisation is an essential competence for mobile robot navigation. Due to the fundamental unreliability of dead reckoning, a robot must depend on its perception of external...
Tom Duckett, Ulrich Nehmzow