153 search results - page 10 / 31 » Near-linear approximation algorithms for geometric hitting s... |
140
Voted
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
160
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The construction of low-dimensional models explaining highdimensional signal observations provides concise and efficient data representations. In this paper, we focus on pattern ...
105
Voted
DM
2010
15 years 3 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
133
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
132
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...