Sciweavers

5785 search results - page 942 / 1157
» Approximability of Probability Distributions
Sort
View
ICGA
2007
157views Optimization» more  ICGA 2007»
15 years 4 months ago
Computing "Elo Ratings" of Move Patterns in the Game of Go
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
Rémi Coulom
NN
2006
Springer
153views Neural Networks» more  NN 2006»
15 years 4 months ago
An incremental network for on-line unsupervised classification and topology learning
This paper presents an on-line unsupervised learning mechanism for unlabeled data that are polluted by noise. Using a similarity thresholdbased and a local error-based insertion c...
Shen Furao, Osamu Hasegawa
PE
2006
Springer
79views Optimization» more  PE 2006»
15 years 4 months ago
Parallel downloads for streaming applications - a resequencing analysis
Several recent studies have proposed methods to accelerate the receipt of a file by downloading its parts from different servers in parallel. The schemes suggested in most propose...
Yoav Nebat, Moshe Sidi
129
Voted
QUESTA
2006
98views more  QUESTA 2006»
15 years 4 months ago
The discrete-time preemptive repeat identical priority queue
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get serv...
Joris Walraevens, Dieter Fiems, Herwig Bruneel
IJON
2007
119views more  IJON 2007»
15 years 4 months ago
Finite sample effects of the fast ICA algorithm
Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y...
Sergio Bermejo