316 search results - page 1 / 64 » On Approximate Majority and Probabilistic Time |
COCO
2007
Springer
13 years 9 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
SIROCCO
2001
13 years 6 months ago
2001
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
IJAR
2008
13 years 5 months ago
2008
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
SIGMOD
2001
ACM
14 years 5 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...