2996 search results - page 303 / 600 » Numberings and Randomness |
178
click to vote
NIPS
2008
15 years 8 months ago
2008
This paper addresses the problem of sparsity pattern detection for unknown ksparse n-dimensional signals observed through m noisy, random linear measurements. Sparsity pattern rec...
162
click to vote
TREC
2004
15 years 8 months ago
2004
Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text sp...
165
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
177
click to vote
IJISEC
2006
15 years 6 months ago
2006
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
205
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...