2654 search results - page 298 / 531 » On Pairing Inversion Problems |
201
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
166
click to vote
GD
2007
Springer
16 years 24 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
161
click to vote
GFKL
2005
Springer
16 years 4 days ago
2005
Springer
In classification, with an increasing number of variables, the required number of observations grows drastically. In this paper we present an approach to put into effect the maxi...
190
click to vote
EMMCVPR
2003
Springer
15 years 12 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
185
click to vote
HIPC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...