2080 search results - page 271 / 416 » Measuring empirical computational complexity |
161
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
157
click to vote
DSN
2007
IEEE
15 years 10 months ago
2007
IEEE
Continuous data protection, which logs every update to a file system, is an enabling technology to protect file systems against malicious attacks and/or user mistakes, because it ...
166
click to vote
PAMI
2008
15 years 6 months ago
2008
In this work, we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the ...
178
click to vote
TCS
1998
15 years 6 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
189
click to vote
ISVC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Research domains that deal with complex molecular systems often employ computer-based thermodynamics simulations to study molecular interactions and investigate phenomena...