53 search results - page 4 / 11 » amire 2005 |
ICIP
2005
IEEE
14 years 1 months ago
2005
IEEE
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
NOLISP
2005
Springer
14 years 1 months ago
2005
Springer
This paper summarizes the rationale for proposing the COST-277 “nonlinear speech processing” action, and the work done during these last four years. In addition, future perspec...
TACAS
2005
Springer
14 years 1 months ago
2005
Springer
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
FORMATS
2005
Springer
14 years 1 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...