Sciweavers

1082 search results - page 50 / 217
» Approximation Algorithms for Spreading Points
Sort
View
ISBI
2008
IEEE
14 years 8 months ago
An accurate PSF model with few parameters for axially shift-variant deconvolution
Accurate knowledge of an imaging system's point spread function (PSF) is crucial for successful deconvolution. For fluorescence microscopy, PSF estimations based on either th...
François Aguet, Dimitri Van De Ville, Micha...
IWDW
2004
Springer
14 years 1 months ago
Fingerprinting Curves
This paper presents a new method for robust data hiding in curves and highlights potential applications including digital fingerprinting of map document for trace and track purpos...
Hongmei Gou, Min Wu
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 11 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»
13 years 7 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...
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
14 years 8 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...