Sciweavers

3096 search results - page 201 / 620
» The Generalized FITC Approximation
Sort
View
129
Voted
IJON
2000
71views more  IJON 2000»
15 years 4 months ago
Variable selection using neural-network models
In this paper we propose an approach to variable selection that uses a neural-network model as the tool to determine which variables are to be discarded. The method performs a bac...
Giovanna Castellano, Anna Maria Fanelli
MOC
2000
124views more  MOC 2000»
15 years 4 months ago
Local and parallel finite element algorithms based on two-grid discretizations
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
Jinchao Xu, Aihui Zhou
117
Voted
PR
2000
130views more  PR 2000»
15 years 4 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan
133
Voted
IJRR
2002
85views more  IJRR 2002»
15 years 4 months ago
On Motion Planning for Robotic Manipulation with Permanent Rolling Contacts
We address the motion planning problem (open-loop trajectory design) for manipulating rigid bodies with permanent rolling contact without slipping. This problem is related in part...
Bálint Kiss, Jean Lévine, Bél...
ML
2002
ACM
146views Machine Learning» more  ML 2002»
15 years 4 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio