1816 search results - page 6 / 364 » A New Approach for Solving the Maximum Clique Problem |
ECCV
1998
Springer
14 years 10 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
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....
NIPS
2007
13 years 10 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
ICDCS
1998
IEEE
14 years 25 days ago
1998
IEEE
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...
ICCV
1998
IEEE
14 years 25 days ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...