Sciweavers

5785 search results - page 551 / 1157
» Approximability of Probability Distributions
Sort
View
NIPS
1994
15 years 8 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad
NIPS
1996
15 years 8 months ago
Hidden Markov Decision Trees
We study a time series model that can be viewed as a decision tree with Markov temporal structure. The model is intractable for exact calculations, thus we utilize variational app...
Michael I. Jordan, Zoubin Ghahramani, Lawrence K. ...
ICASSP
2010
IEEE
15 years 7 months ago
An adaptive level of detail approach to nonlinear estimation
In this work, we present a general method for approximating nonlinear transformations of Gaussian mixture random variables. It is based on transforming the individual Gaussians wi...
Friedrich Faubel, Dietrich Klakow
IJCSA
2007
110views more  IJCSA 2007»
15 years 7 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
CGF
2002
142views more  CGF 2002»
15 years 6 months ago
Efficient Fitting and Rendering of Large Scattered Data Sets Using Subdivision Surfaces
We present a method to efficiently construct and render a smooth surface for approximation of large functional scattered data. Using a subdivision surface framework and techniques...
Vincent Scheib, Jörg Haber, Ming C. Lin, Hans...