2996 search results - page 158 / 600 » Numberings and Randomness |
127
click to vote
ALGORITHMICA
2002
15 years 5 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
181
click to vote
PAIRING
2009
Springer
16 years 2 days ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
130
click to vote
ICMLA
2008
15 years 7 months ago
2008
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
140
click to vote
PR
2006
15 years 5 months ago
2006
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
148
click to vote
JMLR
2010
15 years 10 days ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...