2137 search results - page 226 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
276
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
145
Voted
BMCBI
2008
15 years 6 months ago
2008
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
197
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
189
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...