2040 search results - page 59 / 408 » On the Complexity of Error Explanation |
107
click to vote
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we present a joint source-channel decoding technique based on exact MAP estimation for data encoded by CABAC (Context-based Adaptive Binary Arithmetic Coding) in st...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Currently engineering efficient and successful event-driven applications based on the emerging Complex Event Processing (CEP) technology, is a laborious trial and error process. T...
103
click to vote
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
DATE
1999
IEEE
15 years 4 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
STOC
2004
ACM
16 years 4 days ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...