3946 search results - page 452 / 790 » The computational complexity of choice sets |
175
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
207
click to vote
IEEEPACT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
159
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
196
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
189
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...