330 search results - page 30 / 66 » Approximation Algorithms for the Directed k-Tour and k-Strol... |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
ICCS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
NIPS
2007
13 years 10 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
CPM
2008
Springer
13 years 10 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...