533 search results - page 80 / 107 » The Computational Complexity of Sensitivity Analysis and Par... |
JOCN
2010
13 years 6 months ago
2010
■ We employ a single-trial correlational MEG analysis technique to investigate early processing in the visual recognition of morphologically complex words. Three classes of affi...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
SIGGRAPH
1995
ACM
13 years 11 months ago
1995
ACM
We present a method for searching in an image database using a query image that is similar to the intended target. The query image may be a hand-drawn sketch or a (potentially low...
HPCA
2006
IEEE
14 years 8 months ago
2006
IEEE
Computer systems increasingly rely on dynamic, phasebased system management techniques, in which system hardware and software parameters may be altered or tuned at runtime for dif...