13621 search results - page 340 / 2725 » Computability and Complexity in Self-assembly |
169
click to vote
TOC
2010
15 years 1 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
163
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
211
click to vote
ASP
2005
Springer
16 years 9 days ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
180
Voted
CAISE
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. This paper presents a method to compute metrics that predict maintainability of a system with respect to its event processing. The metrics reflect the complexity of event...
163
click to vote
IJON
2006
15 years 6 months ago
2006
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, very fast convergence is achieved independent of initial condit...