2698 search results - page 224 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
173
click to vote
IPSN
2009
Springer
16 years 1 months 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...
165
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
168
click to vote
AUSDM
2007
Springer
16 years 22 days ago
2007
Springer
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
168
click to vote
PKDD
1999
Springer
15 years 10 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
184
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...