7015 search results - page 235 / 1403 » Approximation algorithms for co-clustering |
146
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
189
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
174
click to vote
ADHOCNOW
2008
Springer
16 years 27 days ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
170
click to vote
GBRPR
2005
Springer
16 years 1 days ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
177
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...