Sciweavers

2740 search results - page 287 / 548
» Approximating Component Selection
Sort
View
AIA
2007
15 years 5 months ago
Adaptive preference elicitation for top-K recommendation tasks using GAI-networks
The enormous number of questions needed to acquire a full preference model when the size of the outcome space is large forces us to work with partial models that approximate the u...
Sérgio R. de M. Queiroz
VMV
2008
165views Visualization» more  VMV 2008»
15 years 5 months ago
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
Christopher Zach, David Gallup, Jan-Michael Frahm,...
ESANN
2006
15 years 5 months ago
Visual object classification by sparse convolutional neural networks
Abstract. A convolutional network architecture termed sparse convolutional neural network (SCNN) is proposed and tested on a real-world classification task (car classification). In...
Alexander Gepperth
NIPS
2004
15 years 5 months ago
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
Daniela Pucci de Farias, Benjamin Van Roy
119
Voted
SODA
2001
ACM
163views Algorithms» more  SODA 2001»
15 years 5 months ago
Algorithms for facility location problems with outliers
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
Moses Charikar, Samir Khuller, David M. Mount, Gir...