4843 search results - page 905 / 969 » The Shortcut Problem - Complexity and Approximation |
159
click to vote
SIGMOD
2006
ACM
15 years 10 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
131
click to vote
SIGMOD
2002
ACM
15 years 10 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
100
click to vote
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...