Sciweavers

451 search results - page 50 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
UAI
2001
13 years 10 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
ICIP
2005
IEEE
14 years 10 months ago
Fusion of multiple viewpoint information towards 3D face robust orientation detection
This paper presents a novel approach to the problem of determining head pose estimation and face 3D orientation of several people in low resolution sequences from multiple calibra...
Cristian Canton-Ferrer, Josep R. Casas, Montse Par...
ICML
2005
IEEE
14 years 9 months ago
Multimodal oriented discriminant analysis
Linear discriminant analysis (LDA) has been an active topic of research during the last century. However, the existing algorithms have several limitations when applied to visual d...
Fernando De la Torre, Takeo Kanade
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 10 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
13 years 10 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...