840 search results - page 132 / 168 » Inapproximability of Combinatorial Optimization Problems |
103
Voted
MVA
2007
15 years 1 months ago
2007
Counting cells and following the evolution of the biological layers are important applications in microscopic imagery. In this paper, a microscopic image segmentation method with ...
123
click to vote
CGF
2010
15 years 14 days ago
2010
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
82
Voted
DM
2010
15 years 13 days ago
2010
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
117
click to vote
SWAT
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
146
Voted
CPM
2009
Springer
14 years 10 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...