1554 search results - page 157 / 311 » Parameterized Complexity and Approximation Algorithms |
145
click to vote
UAI
1996
15 years 4 months ago
1996
Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been sh...
156
click to vote
CGO
2011
IEEE
14 years 7 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
136
click to vote
IVC
2007
15 years 3 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
144
Voted
SIAMSC
2010
15 years 1 months ago
2010
In this paper, we develop a fast multilevel algorithm for simultaneously denoising and deblurring images under the total variation regularization. Although much effort has been de...
142
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...