2080 search results - page 103 / 416 » Measuring empirical computational complexity |
114
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
In the half-century since the C-value paradox (the apparent lack of correlation between organismal genome size and morphological complexity) was described, there have been no expli...
127
click to vote
EUROCRYPT
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
140
click to vote
SC
2004
ACM
15 years 9 months ago
2004
ACM
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
122
click to vote
COLT
2000
Springer
15 years 8 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
154
click to vote
ADC
2008
Springer
15 years 10 months ago
2008
Springer
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...