Sciweavers

2040 search results - page 243 / 408
» Approximate Expectation Maximization
Sort
View
140
Voted
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 3 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
137
Voted
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
16 years 3 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
141
Voted
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
195
Voted
CVPR
2009
IEEE
16 years 10 months ago
Illumination and Spatially Varying Specular Reflectance from a Single View
Estimating the illumination and the reflectance properties of an object surface from a sparse set of images is an important but inherently ill-posed problem. The problem becomes...
Kenji Hara (Kyushu University), Ko Nishino (Drexel...
150
Voted
CVPR
2009
IEEE
16 years 10 months ago
Nonparametric Discriminant HMM and Application to Facial Expression Recognition
This paper presents a nonparametric discriminant HMM and applies it to facial expression recognition. In the proposed HMM, we introduce an effective nonparametric output probabi...
Lifeng Shang (The University of Hong Kong), Kwok-P...