Sciweavers

761 search results - page 73 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
13 years 5 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
CVPR
2007
IEEE
14 years 9 months ago
In Situ Evaluation of Tracking Algorithms Using Time Reversed Chains
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
Hao Wu, Aswin C. Sankaranarayanan, Rama Chellappa
APIN
2010
151views more  APIN 2010»
13 years 8 months ago
Improved PLSOM algorithm
The original Parameter-Less Self-Organising Map (PLSOM) algorithm was introduced as a solution to the problems the Self-Organising Map (SOM) encounters when dealing with certain ty...
Erik Berglund
ESANN
2001
13 years 9 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à
CSDA
2006
94views more  CSDA 2006»
13 years 7 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