Sciweavers

729 search results - page 107 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
ALT
2001
Springer
14 years 4 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
LATA
2010
Springer
14 years 2 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark
ICSE
2009
IEEE-ACM
14 years 2 months ago
Software Engineering for the Next Internet
The Internet no longer meets the world’s requirements. Recognition of the Internet architecture’s inherent flaws has opened a window of opportunity for fresh thinking: granti...
Pamela Zave
MCS
2009
Springer
14 years 2 months ago
True Path Rule Hierarchical Ensembles
Abstract. Hierarchical classification problems gained increasing attention within the machine learning community, and several methods for hierarchically structured taxonomies have...
Giorgio Valentini
DATE
2009
IEEE
110views Hardware» more  DATE 2009»
14 years 2 months ago
Light NUCA: A proposal for bridging the inter-cache latency gap
Abstract—To deal with the “memory wall” problem, microprocessors include large secondary on-chip caches. But as these caches enlarge, they originate a new latency gap between...
Darío Suárez Gracia, Teresa Monreal,...