4843 search results - page 582 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
DCC
2004
IEEE
16 years 4 months ago
2004
IEEE
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...
138
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
—This paper introduces a simple method for calculating the times at which any signal crosses a prespecified threshold voltage (e.g., 10%, 20%, 50%, etc.) directly from the moment...
166
click to vote
CVPR
2010
IEEE
16 years 26 days ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
119
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
149
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...