3894 search results - page 434 / 779 » Approximation Algorithms for Biclustering Problems |
156
click to vote
ICA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
120
click to vote
JCO
2006
15 years 4 months ago
2006
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
144
click to vote
CAD
2005
Springer
15 years 4 months ago
2005
Springer
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
131
click to vote
TNN
2010
14 years 11 months ago
2010
Abstract--In this paper we investigate the sparsity and recognition capabilities of two approximate Bayesian classification algorithms, the multi-class multi-kernel Relevance Vecto...
144
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...