3875 search results - page 224 / 775 » Approximation algorithms for the 0-extension problem |
152
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
189
click to vote
APPROX
2004
Springer
15 years 11 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 ...
138
click to vote
WALCOM
2010
IEEE
16 years 1 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
138
click to vote
EMO
2003
Springer
15 years 11 months ago
2003
Springer
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...
165
Voted
IPSN
2009
Springer
16 years 28 days ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...