62 search results - page 6 / 13 » A New Approach to Exact Crossing Minimization |
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
EOR
2006
13 years 7 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
ALENEX
2009
13 years 9 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
WSCG
2004
13 years 9 months ago
2004
Colorizing grayscale video is a useful technique in scientific computing visualization and entertainment. In this paper, we introduce a method to transfer color from a reference i...