447 search results - page 61 / 90 » Approximation Algorithms for Directed Steiner Problems |
121
click to vote
DCC
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
108
click to vote
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
124
click to vote
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
120
Voted
NIPS
2008
15 years 4 months ago
2008
We present a multi-label multiple kernel learning (MKL) formulation in which the data are embedded into a low-dimensional space directed by the instancelabel correlations encoded ...
219
click to vote
CORR
2010
Springer
15 years 8 days 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...