12825 search results - page 488 / 2565 » Improved PLSOM algorithm |
162
click to vote
CIVR
2003
Springer
16 years 28 days ago
2003
Springer
Margin-maximizing techniques such as boosting have been generating excitement in machine learning circles for several years now. Although these techniques offer significant impro...
207
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Garbage collection can be a performance bottleneck in large distributed, multi-threaded applications. Applications may produce millions of objects during their lifetimes and may i...
222
Voted
CPM
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
225
click to vote
FLAIRS
2004
15 years 9 months ago
2004
Novelty detection in time series is an important problem with application in different domains such as machine failure detection, fraud detection and auditing. An approach to this...
188
click to vote
MLMTA
2003
15 years 9 months ago
2003
— This work shows comparatively the capacity of five Fuzzy Lattice Neurocomputing (FLN) classifiers. The mechanics of the five classifiers are illustrated geometrically on the pl...