973 search results - page 30 / 195 » New Bounds on Crossing Numbers |
CP
2009
Springer
14 years 9 months ago
2009
Springer
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
107
click to vote
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we present a new speaker diarization system that improves the accuracy of traditional hierarchical clustering-based methods with little increase in computational co...
JUCS
2008
14 years 11 months ago
2008
: Nowadays, the complexity of software applications has brought new challenges to developers, having to deal with a large number of computational requirements. Among these requirem...
ICCV
2005
IEEE
16 years 1 months ago
2005
IEEE
The Crossed-Slits (X-Slits) projection can be used to generate new views of a scene from a sequence of perspective images. Compared with other image-based rendering (IBR) techniqu...
WEA
2007
Springer
15 years 6 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...