280 search results - page 5 / 56 » New Algorithms for Enumerating All Maximal Cliques |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
In this paper, we address the problem of video object segmentation, which is to automatically identify the primary object and segment the object out in every frame. We propose a n...
JMLR
2010
13 years 3 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....