40 search results - page 3 / 8 » Can Random Coin Flips Speed Up a Computer |
SOFSEM
2001
Springer
14 years 1 days ago
2001
Springer
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
SIAMCOMP
1998
13 years 7 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...