Sciweavers

691 search results - page 120 / 139
» Constructing Ensembles from Data Envelopment Analysis
Sort
View
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
14 years 1 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
EMMCVPR
2005
Springer
14 years 1 months ago
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
Abstract. Estimation of parameters of random field models from labeled training data is crucial for their good performance in many image analysis applications. In this paper, we p...
Sanjiv Kumar, Jonas August, Martial Hebert
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
14 years 1 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
COLT
1999
Springer
13 years 11 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
PLDI
1994
ACM
13 years 11 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali