274 search results - page 15 / 55 » On Random Sampling over Joins |
218
click to vote
SIGMOD
2005
ACM
16 years 1 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
133
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
118
click to vote
PKDD
2010
Springer
15 years 6 days ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
104
click to vote
SEMWEB
2007
Springer
15 years 8 months ago
2007
Springer
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
116
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...