7015 search results - page 280 / 1403 » Approximation algorithms for co-clustering |
168
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
178
click to vote
ICCAD
1993
IEEE
15 years 10 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
144
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
151
click to vote
WADS
2007
Springer
16 years 22 days ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
206
click to vote
CBMS
2005
IEEE
16 years 8 days ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...