1064 search results - page 154 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
122
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
193
click to vote
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
146
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
142
click to vote
SIAMDM
2008
15 years 4 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
157
click to vote
IANDC
2006
15 years 4 months ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...