2796 search results - page 378 / 560 » The coolest path problem |
167
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
261
click to vote
VLDB
2005
ACM
16 years 6 months ago
2005
ACM
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
261
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
256
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Like HTML, many XML documents are resident on native file systems. Since XML data is irregular and verbose, the disk space and the network bandwidth are wasted. To overcome the ve...
167
click to vote
EDBT
2002
ACM
16 years 6 months ago
2002
ACM
Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML ...