874 search results - page 23 / 175 » Faster Algorithms for Semi-Matching Problems |
AAAI
2004
14 years 11 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
GECCO
2009
Springer
14 years 7 months ago
2009
Springer
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...
104
click to vote
ISBI
2011
IEEE
14 years 1 months ago
2011
IEEE
We develop a new algorithm to segment the hippocampus from MR images. Our method uses a new classifier ensemble algorithm to correct segmentation errors produced by a multi-atlas...
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
PAIRING
2007
Springer
15 years 3 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...