Sciweavers

535 search results - page 9 / 107
» Generalized Version Space Trees
Sort
View
JMLR
2006
105views more  JMLR 2006»
14 years 11 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai
81
Voted
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
15 years 5 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
MOBIQUITOUS
2008
IEEE
15 years 6 months ago
How to edit gigabyte XML files on a mobile phone with XAS, RefTrees, and RAXS
The Open Source mobility middleware developed in the Fuego Core project provides a stack for efficient XML processing on limited devices. Its components are a persistent map API, ...
Tancred Lindholm, Jaakko Kangasharju
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 11 months ago
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
Michael B. Baer
101
Voted
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 11 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...