CPAIOR
2011
Springer
13 years 3 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
CPAIOR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
CPAIOR
2011
Springer
13 years 3 months ago
2011
Springer
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
CPAIOR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
ORL
2011
13 years 5 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
PAA
2010
13 years 6 months ago
2010
Abstract Fingerprint classification represents an important preprocessing step in fingerprint identification, which can be very helpful in reducing the cost of searching large fing...
PAA
2010
13 years 6 months ago
2010
In this paper, we present a novel and robust road tracking system for vision-based personal navigation. Novelty of the work includes the use of multiple Condensation filters to tra...
PAA
2010
13 years 6 months ago
2010
This paper presents a pair of identification technique that automatically detect scripts and orientations of document images suffering from various types of document degradation. ...
ORL
2010
13 years 6 months ago
2010
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N(
ORL
2010
13 years 6 months ago
2010
Rationing is an inventory policy that allows prioritization of demand classes. It enables the inventory system to provide higher service levels for critical demand classes. In thi...