215 search results - page 15 / 43 » Sums of squares based approximation algorithms for MAX-SAT |
SODA
1997
ACM
13 years 8 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
SCALESPACE
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Gaussian convolutions are perhaps the most often used image operators in low-level computer vision tasks. Surprisingly though, there are precious few articles that descri...
AAECC
2007
Springer
13 years 7 months ago
2007
Springer
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
ENDM
2010
13 years 7 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...