12183 search results - page 2296 / 2437 » Computers under Attacks! |
204
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
254
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
269
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
254
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Cell phones are increasingly being used as common clients for a wide suite of distributed, database-centric healthcare applications in developing regions. This is particularly tru...
262
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...