Sciweavers

17 search results - page 2 / 4
» Input and Structure Selection for k-NN Approximator
Sort
View
UAI
2008
13 years 7 months ago
Observation Subset Selection as Local Compilation of Performance Profiles
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
Yan Radovilsky, Solomon Eyal Shimony
CGF
2010
165views more  CGF 2010»
13 years 5 months ago
Hierarchical Structure Recovery of Point-Sampled Surfaces
We focus on the class of regular models defined by Várady et al. for reverse engineering purposes. Given a 3D surface M represented through a dense set of points, we present a n...
Marco Attene, Giuseppe Patanè
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
13 years 11 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon
WSC
1997
13 years 7 months ago
Covalidation of Dissimilarly Structured Models
A methodology is presented which allows comparison between models under different modeling paradigms. Consider the following situation: Two models have been constructed to study d...
Samuel A. Wright, Kenneth W. Bauer Jr.
NIPS
2007
13 years 7 months ago
Sparse Feature Learning for Deep Belief Networks
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
Marc'Aurelio Ranzato, Y-Lan Boureau, Yann LeCun