20294 search results - page 170 / 4059 » Algorithmic Information Theory |
133
click to vote
IJCAI
2003
15 years 6 months ago
2003
In this paper we propose the framework of Monte Carlo algorithms as a useful one to analyze ensemble learning. In particular, this framework allows one to guess when bagging will ...
163
Voted
EC
1998
15 years 4 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
111
click to vote
MOC
2002
15 years 4 months ago
2002
ABSTRACT. The aim of this paper is to provide a convergence analysis for a preconditioned subspace iteration, which is designated to determine a modest number of the smallest eigen...
164
Voted
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
164
click to vote
EMSOFT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...