Sciweavers

1261 search results - page 70 / 253
» Approximation algorithms for aligning points
Sort
View
TSMC
2010
14 years 4 months ago
Incomplete Multigranulation Rough Set
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
Yuhua Qian, Jiye Liang, Chuangyin Dang
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
15 years 10 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
15 years 11 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 1 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
14 years 9 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...