7015 search results - page 303 / 1403 » Approximation algorithms for co-clustering |
214
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
163
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
171
click to vote
WSC
2001
15 years 8 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
151
click to vote
IPL
2010
15 years 5 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
156
click to vote
JMLR
2010
15 years 1 months ago
2010
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...