20197 search results - page 437 / 4040 » Comparing Computational Power |
165
click to vote
FOCS
1994
IEEE
15 years 11 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...
194
click to vote
NSDI
2004
15 years 8 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 ...
187
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
234
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
161
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We consider the optimal amount of training for single-antenna Rayleigh flat fading channels with peak-powerlimited input. The receiver uses known training symbols to perform m...