7129 search results - page 803 / 1426 » Approximation Algorithms for Treewidth |
189
click to vote
CAD
2008
Springer
15 years 6 months ago
2008
Springer
When designing curves on surfaces the need arises to approximate a given noisy target shape by a smooth fitting shape. We discuss the problem of fitting a B-spline curve to a poin...
148
click to vote
CMPB
2010
15 years 6 months ago
2010
We demonstrate the use of highly parallel graphics processing units (GPUs) to accelerate the Superposition/Convolution (S/C) algorithm to interactive rates while reducing the numbe...
180
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a welldesign...
167
click to vote
DAM
2007
15 years 6 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
172
click to vote
JMLR
2006
15 years 6 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...