Sciweavers

2292 search results - page 202 / 459
» Hierarchical approximation and localization
Sort
View
NIPS
1998
15 years 8 months ago
Lazy Learning Meets the Recursive Least Squares Algorithm
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
Mauro Birattari, Gianluca Bontempi, Hugues Bersini
NIPS
1996
15 years 8 months ago
Early Brain Damage
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...
Volker Tresp, Ralph Neuneier, Hans-Georg Zimmerman...
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
15 years 6 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
JC
1998
65views more  JC 1998»
15 years 6 months ago
Monte Carlo Complexity of Global Solution of Integral Equations
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
Stefan Heinrich
ICIP
2000
IEEE
16 years 8 months ago
Model-Aided Coding of Multi-Viewpoint Image Data
The paper presents a novel coding technique based on approximate geometry for images taken from arbitrary recording positions around a 3-D scene. Such data structures occur in ima...
Marcus A. Magnor, Peter Eisert, Bernd Girod