5329 search results - page 267 / 1066 » The Weighted Majority Algorithm |
212
click to vote
DATAMINE
1999
15 years 6 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
172
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
214
click to vote
PR
2011
15 years 1 months ago
2011
Non-blind motion deblurring problems are highly ill-posed and so it is quite difficult to find the original sharp and clean image. To handle ill-posedness of the motion deblurrin...
272
click to vote
GIS
2009
ACM
16 years 7 months ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
198
click to vote
ADMA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...