Sciweavers

316 search results - page 20 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
IJRR
2007
60views more  IJRR 2007»
13 years 7 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
AI
2011
Springer
13 years 2 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
13 years 11 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng
ICDT
2011
ACM
232views Database» more  ICDT 2011»
12 years 11 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...