1712 search results - page 190 / 343 » A Computational Approach to Binding Theory |
184
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by estimating a reference shape and a set of rigid transformations gi...
136
click to vote
TPLP
2002
15 years 1 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
111
click to vote
CHI
2004
ACM
16 years 2 months ago
2004
ACM
We identify a wide range of human memory phenomena as potential certificates of identity. These "imprinting" behaviors are characterized by vast capacity for complex exp...
96
Voted
BIRTHDAY
2009
Springer
15 years 8 months ago
2009
Springer
We propose to model the development of language by a series of formal grammars, accounting for the linguistic capacity of children at the very early stages of mastering language. T...
ACMSE
2006
ACM
15 years 7 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...