7015 search results - page 1080 / 1403 » Approximation algorithms for co-clustering |
157
click to vote
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
164
click to vote
TASLP
2010
14 years 11 months ago
2010
This paper presents a novel probabilistic approach to speech enhancement. Instead of a deterministic logarithmic relationship, we assume a probabilistic relationship between the fr...
142
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
288
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
146
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...