9842 search results - page 327 / 1969 » The Complexity of the Matching-Cut Problem |
127
click to vote
CHI
1995
ACM
15 years 7 months ago
1995
ACM
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...
126
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
130
click to vote
EMNLP
2008
15 years 5 months ago
2008
In recent years there has been substantial work on the important problem of coreference resolution, most of which has concentrated on the development of new models and algorithmic...
146
click to vote
FCS
2006
15 years 5 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
123
click to vote
COGSCI
2010
15 years 4 months ago
2010
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...