7930 search results - page 1383 / 1586 » Greedy in Approximation Algorithms |
167
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
131
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
161
click to vote
PODS
2001
ACM
16 years 4 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
141
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
157
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffici...