1389 search results - page 122 / 278 » Improved Approximation Algorithms for Label Cover Problems |
138
click to vote
IJWIN
2006
15 years 3 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
173
click to vote
TSMC
2010
14 years 10 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
146
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
146
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
242
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...