40 search results - page 4 / 8 » The Pair Completion algorithm for the Homogeneous Set Sandwi... |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
CP
2009
Springer
14 years 8 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
CIMCA
2006
IEEE
14 years 1 months ago
2006
IEEE
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...
EOR
2007
13 years 7 months ago
2007
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...