2107 search results - page 292 / 422 » Computing Small Search Numbers in Linear Time |
125
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
115
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
134
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
111
click to vote
ISCAS
2006
IEEE
15 years 8 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
104
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...