Sciweavers

274 search results - page 34 / 55
» Approximating Edit Distance Efficiently
Sort
View
PERCOM
2008
ACM
14 years 9 months ago
Location Fingerprint Analyses Toward Efficient Indoor Positioning
Abstract--Analytical models to evaluate and predict "precision" performance of indoor positioning systems based on location fingerprinting are lacking. Such models can be...
Nattapong Swangmuang, Prashant Krishnamurthy
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 7 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
COMGEO
2004
ACM
13 years 9 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
ATAL
2010
Springer
13 years 11 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
SEMWEB
2007
Springer
14 years 4 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...