Sciweavers

9842 search results - page 297 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
108
Voted
ACL
1993
15 years 5 months ago
Principle-Based Parsing without Overgeneration
Overgeneration is the main source of computational complexity in previous principle-based parsers. This paper presents a message passing algorithm for principle-based parsing that...
Dekang Lin
132
Voted
AMAST
2008
Springer
15 years 5 months ago
Generating Specialized Rules and Programs for Demand-Driven Analysis
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu
123
Voted
AGI
2008
15 years 5 months ago
Learning from Inconsistencies in an Integrated Cognitive Architecture
Whereas symbol
Kai-Uwe Kühnberger, Peter Geibel, Helmar Gust...
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 3 months ago
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
Barnaby Martin
164
Voted
NN
2006
Springer
234views Neural Networks» more  NN 2006»
15 years 3 months ago
Attention in natural scenes: Neurophysiological and computational bases
How does attention operate in natural scenes? We show that the receptive fields of inferior temporal cortex neurons that implement object representations become small and located ...
Edmund T. Rolls, Gustavo Deco