7200 search results - page 170 / 1440 » On the Computational Power of Winner-Take-All |
156
click to vote
CHI
2000
ACM
15 years 10 months ago
2000
ACM
We have designed and implemented new Web browsing facilities to support effective navigation on Personal Digital Assistants (PDAs) with limited capabilities: low bandwidth, small ...
169
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
1 In this paper, we propose a hybrid approach for estimating the switching activities of the internal nodes in logic circuits. The new approach combines the advantages of the simul...
152
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
184
click to vote
NSDI
2004
15 years 7 months ago
2004
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
194
click to vote
HPDC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...