1878 search results - page 89 / 376 » The Vienna Abstract Machine |
COLT
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We pose the problem of determining the rate of convergence at which AdaBoost minimizes exponential loss. Boosting is the problem of combining many "weak," high-...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...
ALT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—A premier goal of resource allocators in virtualization environments is to control the relative resource consumption of the different virtual machines, and moreover, to ...
SAC
2004
ACM
14 years 3 months ago
2004
ACM
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...