14699 search results - page 492 / 2940 » Complexity and Cognitive Computing |
184
Voted
TOC
2010
15 years 2 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 ...
188
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...
221
Voted
ASP
2005
Springer
16 years 28 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 ...
198
click to vote
CAISE
2003
Springer
16 years 18 days 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...
176
Voted
IJON
2006
15 years 7 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...