1201 search results - page 196 / 241 » Linear Probing and Graphs |
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
TAMC
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
DGCI
2009
Springer
14 years 2 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
CATS
2008
14 years 13 days ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
ICML
2010
IEEE
14 years 2 days ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...