Sciweavers

18572 search results - page 895 / 3715
» High performance C
Sort
View
CONNECTION
2004
98views more  CONNECTION 2004»
15 years 7 months ago
Self-refreshing memory in artificial neural networks: learning temporal sequences without catastrophic forgetting
While humans forget gradually, highly distributed connectionist networks forget catastrophically: newly learned information often completely erases previously learned information. ...
Bernard Ans, Stephane Rousset, Robert M. French, S...
ML
2000
ACM
144views Machine Learning» more  ML 2000»
15 years 7 months ago
MultiBoosting: A Technique for Combining Boosting and Wagging
MultiBoosting is an extension to the highly successful AdaBoost technique for forming decision committees. MultiBoosting can be viewed as combining AdaBoost with wagging. It is abl...
Geoffrey I. Webb
APAL
1998
71views more  APAL 1998»
15 years 7 months ago
On the Finiteness of the Recursive Chromatic Number
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
William I. Gasarch, Andrew C. Y. Lee
JPDC
2010
123views more  JPDC 2010»
15 years 6 months ago
Maintaining the Ranch topology
Topology maintenance, or how to handle the possibly concurrent joining and leaving of nodes, is a central problem for structured peer-to-peer networks. A good topology maintenance...
Xiaozhou Li, Jayadev Misra, C. Greg Plaxton
ICIP
2010
IEEE
15 years 5 months ago
Learning simple texture discrimination filters
Current texture analysis methods enable good discrimination but are computationally too expensive for applications which require high frame rates. This occurs because they use red...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar