Sciweavers

3874 search results - page 385 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
174
Voted
ESANN
2001
15 years 7 months ago
Learning fault-tolerance in Radial Basis Function Networks
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
Xavier Parra, Andreu Català
ICML
2010
IEEE
15 years 7 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
CSDA
2006
94views more  CSDA 2006»
15 years 6 months ago
Simulation-based approach to estimation of latent variable models
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
Zhiguang Qian, Alexander Shapiro
GI
2009
Springer
15 years 4 months ago
Gaussian Mixture (GM) Passive Localization using Time Difference of Arrival (TDOA)
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
Regina Kaune
ARITH
2011
IEEE
14 years 6 months ago
Short Division of Long Integers
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
David Harvey, Paul Zimmermann