3415 search results - page 480 / 683 » Lower bounds on kernelization |
141
click to vote
TIT
2010
15 years 1 months ago
2010
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
203
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
191
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...
150
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper presents a new receiver-initiated sensor network MAC protocol, called CyMAC, which has the following unique features. It reduces the idle listening time of sensor nod...
204
click to vote
SOFSEM
2012
Springer
14 years 2 months ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...