7200 search results - page 277 / 1440 » On the Computational Power of Winner-Take-All |
207
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
153
click to vote
CHI
2001
ACM
16 years 7 months ago
2001
ACM
In this paper, we introduce Folk Computing: an approach for using technology to support co-present community building inspired by the concept of folklore. We also introduce a new ...
164
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
164
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— A powerful path computation element is a must for the next-generation IP-over-Optical networks to support ondemand service provisioning crossing layers. The main purpose of pat...
168
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...