Sciweavers

1578 search results - page 236 / 316
» Induction of Stable Models
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 10 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
COGSCI
2010
82views more  COGSCI 2010»
13 years 10 months ago
Language Acquisition Meets Language Evolution
Recent research suggests that language evolution is a process of cultural change, in which linguistic structures are shaped through repeated cycles of learning and use by domain-g...
Nick Chater, Morten H. Christiansen
BMCBI
2006
98views more  BMCBI 2006»
13 years 10 months ago
The Secrets of a Functional Synapse - From a Computational and Experimental Viewpoint
Background: Neuronal communication is tightly regulated in time and in space. The neuronal transmission takes place in the nerve terminal, at a specialized structure called the sy...
Michal Linial
ESWA
2006
149views more  ESWA 2006»
13 years 10 months ago
An effective refinement strategy for KNN text classifier
Due to the exponential growth of documents on the Internet and the emergent need to organize them, the automated categorization of documents into predefined labels has received an...
Songbo Tan
IANDC
2006
117views more  IANDC 2006»
13 years 10 months ago
A modular approach to defining and characterising notions of simulation
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
Corina Cîrstea