9842 search results - page 204 / 1969 » The Complexity of the Matching-Cut Problem |
110
click to vote
ICCBR
2007
Springer
15 years 4 months ago
2007
Springer
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...
85
Voted
AAAI
1992
15 years 1 months ago
1992
est case using an abstraction hierarchy in problem-solving can yield an exponential speed-up in search e ciency. Such a speed-up is predicted by various analytical models develope...
93
Voted
NIPS
1992
15 years 1 months ago
1992
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
107
click to vote
IJCGA
2008
15 years 17 days ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
121
Voted
JMLR
2010
14 years 11 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...