1201 search results - page 196 / 241 » Linear Probing and Graphs |
123
click to vote
GECCO
2004
Springer
15 years 8 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...
145
click to vote
TAMC
2010
Springer
15 years 8 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. ...
136
click to vote
DGCI
2009
Springer
15 years 6 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...
117
click to vote
CATS
2008
15 years 4 months 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...
124
click to vote
ICML
2010
IEEE
15 years 4 months 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...