Sciweavers

2517 search results - page 111 / 504
» Specifying Weak Sets
Sort
View
IJCAI
1989
15 years 6 months ago
An Experimental Comparison of Symbolic and Connectionist Learning Algorithms
Despite the fact that many symbolic and connectionist (neural net) learning algorithms are addressing the same problem of learning from classified examples, very little Is known r...
Raymond J. Mooney, Jude W. Shavlik, Geoffrey G. To...
156
Voted
ICML
2010
IEEE
15 years 6 months ago
Music Plus One and Machine Learning
A system for musical accompaniment is presented in which a computer-driven orchestra follows and learns from a soloist in a concerto-like setting. The system is decomposed into th...
Christopher Raphael
ANOR
2008
69views more  ANOR 2008»
15 years 5 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 5 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
JNS
2008
44views more  JNS 2008»
15 years 5 months ago
The Scaling Attractor and Ultimate Dynamics for Smoluchowski's Coagulation Equations
We describe a basic framework for studying dynamic scaling that has roots in dynamical systems and probability theory. Within this framework, we study Smoluchowski's coagulat...
Govind Menon, Robert L. Pego