COCOA
2010
Springer
13 years 8 months ago
2010
Springer
COCOA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
COCOA
2010
Springer
13 years 8 months ago
2010
Springer
We are searching for an unknown horizontal or vertical line in the plane under the competitive framework. We design a well-suited framework for all cylcic strategies that result in...
COCOA
2010
Springer
13 years 8 months ago
2010
Springer
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
DCG
2008
13 years 11 months ago
2008
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This imp...
DGCI
2009
Springer
13 years 12 months ago
2009
Springer
To find corresponding points in different poses of the same articulated shape, a non rigid coordinate system is used. Each pixel of each shape is identified by a pair of distinct c...
DGCI
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Discrete tomography is a powerful approach for reconstructing images that contain only a few grey levels from their projections. Most theory and reconstruction algorithms...
DGCI
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. Differential operators are essential in many image processing applications. Previous work has shown how to compute derivatives more accurately by examining the image loca...
COCOA
2008
Springer
13 years 12 months ago
2008
Springer
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we ex...
COCOA
2008
Springer
13 years 12 months ago
2008
Springer
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...