3875 search results - page 261 / 775 » Approximation algorithms for the 0-extension problem |
187
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
196
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
190
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
173
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...