15792 search results - page 186 / 3159 » Computational Abstraction Steps |
160
click to vote
COLING
1990
15 years 7 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
104
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
144
Voted
ISCC
2006
IEEE
16 years 5 days ago
2006
IEEE
Inter-domain path computation, or the ability to compute end-to-end paths across multiple domains, is the next step toward wide deployment of a distributed control plane with supp...
129
click to vote
ERSA
2006
15 years 7 months ago
2006
: A brief review of mapping generalized template matching operations onto reconfigurable computers is given. A combinatorial optimization process, where the objective is to minimiz...
156
Voted
SCL
2008
15 years 6 months ago
2008
In this paper a computational algorithm for nonlinear balanced realization and model reduction based on Taylor series expansion is proposed. This algorithm requires recursive comp...