7129 search results - page 327 / 1426 » Approximation Algorithms for Treewidth |
146
click to vote
ISAAC
2001
Springer
15 years 9 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
138
click to vote
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
134
click to vote
NIPS
2008
15 years 6 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
149
Voted
JMIV
2010
14 years 11 months ago
2010
This paper proposes robust algorithms to deconvolve discrete noised signals and images. The solutions are derived as linear combinations of spline wavelet packets that minimize so...
143
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...