1816 search results - page 68 / 364 » A New Approach for Solving the Maximum Clique Problem |
146
click to vote
ICASSP
2009
IEEE
16 years 21 days ago
2009
IEEE
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
136
click to vote
PUK
2003
15 years 7 months ago
2003
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
457
click to vote
IPMI
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. Multi-object segmentation with mutual interaction is a challenging task in medical image analysis. We report a novel solution to a segmentation problem, in which target o...
163
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
196
click to vote
EOR
2007
15 years 5 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...