Sciweavers

295 search results - page 18 / 59
» A Robust Minimax Approach to Classification
Sort
View
4OR
2005
104views more  4OR 2005»
13 years 9 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
ICML
2008
IEEE
14 years 9 months ago
Extracting and composing robust features with denoising autoencoders
Previous work has shown that the difficulties in learning deep generative or discriminative models can be overcome by an initial unsupervised learning step that maps inputs to use...
Pascal Vincent, Hugo Larochelle, Yoshua Bengio, Pi...
SDM
2008
SIAM
121views Data Mining» more  SDM 2008»
13 years 10 months ago
Integration of Multiple Networks for Robust Label Propagation
Transductive inference on graphs such as label propagation algorithms is receiving a lot of attention. In this paper, we address a label propagation problem on multiple networks a...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama
DLS
2010
162views Languages» more  DLS 2010»
13 years 7 months ago
Proxies: design principles for robust object-oriented intercession APIs
Proxies are a powerful approach to implement meta-objects in object-oriented languages without having to resort to metacircular interpretation. We introduce such a meta-level API ...
Tom Van Cutsem, Mark S. Miller
CVPR
2009
IEEE
15 years 4 months ago
Contextual Classification with Functional Max-Margin Markov Networks
We address the problem of label assignment in computer vision: given a novel 3-D or 2-D scene, we wish to assign a unique label to every site (voxel, pixel, superpixel, etc.). To...
Daniel Munoz, James A. Bagnell, Martial Hebert, Ni...