Sciweavers

299 search results - page 44 / 60
» Optimizing Polynomial Solvers for Minimal Geometry Problems
Sort
View
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
ICALP
2005
Springer
14 years 1 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
TIP
2002
131views more  TIP 2002»
13 years 7 months ago
Optimal edge-based shape detection
Abstract--We propose an approach to accurately detecting twodimensional (2-D) shapes. The cross section of the shape boundary is modeled as a step function. We first derive a one-d...
Hankyu Moon, Rama Chellappa, Azriel Rosenfeld
EMMCVPR
2011
Springer
12 years 7 months ago
Curvature Regularization for Curves and Surfaces in a Global Optimization Framework
Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we pr...
Petter Strandmark, Fredrik Kahl
EOR
2007
117views more  EOR 2007»
13 years 7 months ago
Considering manufacturing cost and scheduling performance on a CNC turning machine
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
Sinan Gurel, M. Selim Akturk