5221 search results - page 258 / 1045 » An On-line Problem Database |
173
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
178
click to vote
VLDB
2005
ACM
16 years 2 days ago
2005
ACM
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
268
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
272
click to vote
VLDB
2009
ACM
16 years 6 months ago
2009
ACM
For a largenumber of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smallest)...
293
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...