3894 search results - page 522 / 779 » Approximation Algorithms for Biclustering Problems |
122
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
146
click to vote
WWW
2005
ACM
16 years 4 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
118
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
125
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
153
click to vote
IDA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...