1554 search results - page 204 / 311 » Parameterized Complexity and Approximation Algorithms |
123
click to vote
NIPS
2008
15 years 4 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
133
click to vote
DCC
2005
IEEE
16 years 2 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
129
click to vote
DCC
2002
IEEE
16 years 2 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...
127
click to vote
SIGGRAPH
1994
ACM
15 years 7 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
170
click to vote
JMLR
2012
13 years 5 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...