13621 search results - page 339 / 2725 » Computability and Complexity in Self-assembly |
176
click to vote
COLING
1990
15 years 8 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...
112
Voted
DCC
2006
IEEE
16 years 6 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...
177
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Informatio...
166
click to vote
EUSFLAT
2007
15 years 8 months ago
2007
The embedded soft computing approach in wireless sensor networks is suggested. This approach means a combination of embedded fuzzy logic and neural networks models for information...
182
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: An increasing number of scientific research projects require access to large-scale computational resources. This is particularly true in the biological field, whether ...