2434 search results - page 194 / 487 » Algorithmic Randomness of Closed Sets |
130
click to vote
BIOADIT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
147
click to vote
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
129
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
174
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
125
click to vote
ICDT
1999
ACM
15 years 8 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...