217 search results - page 38 / 44 » Backdoors To Typical Case Complexity |
138
click to vote
CODES
2002
IEEE
15 years 4 months ago
2002
IEEE
The aggressive evolution of the semiconductor industry — smaller process geometries, higher densities, and greater chip complexity — has provided design engineers the means to...
WIESS
2000
15 years 13 days ago
2000
As IPC mechanisms become faster, stub-code efficiency becomes a performance issue for local client/server RPCs and inter-component communication. Inefficient and unnecessary compl...
BMCBI
2006
14 years 11 months ago
2006
Background: Overfitting the data is a salient issue for classifier design in small-sample settings. This is why selecting a classifier from a constrained family of classifiers, on...
CORR
2000
Springer
14 years 11 months ago
2000
Springer
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
106
click to vote
SIAMCOMP
1998
14 years 10 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...