1816 search results - page 117 / 364 » A New Approach for Solving the Maximum Clique Problem |
180
click to vote
EOR
2010
15 years 3 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
183
click to vote
ICTAI
2008
IEEE
16 years 16 days ago
2008
IEEE
The main challenge of cluster analysis is that the number of clusters or the number of model parameters is seldom known, and it must therefore be determined before clustering. Bay...
174
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
207
Voted
TNN
2011
15 years 1 months ago
2011
Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. Intuitively, discovering a good feature rep...
150
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Uknown to us, an axially-symmetric surface is broken into disjoint pieces along a set of break-curves, i.e., the curves along which the surface locally breaks into two pieces. A s...