274 search results - page 16 / 55 » On Random Sampling over Joins |
101
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
125
click to vote
VIS
2005
IEEE
16 years 3 months ago
2005
IEEE
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
106
Voted
RIDE
1997
IEEE
15 years 6 months ago
1997
IEEE
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...
125
click to vote
ECCC
2010
15 years 1 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
120
Voted
DAWAK
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Pearson product-moment correlation coefficients are a wellpracticed quantification of linear dependence seen across many fields. When calculating a sample-based correlati...