156 search results - page 28 / 32 » On the Round Complexity of Covert Computation |
115
Voted
PODC
2011
ACM
14 years 2 months ago
2011
ACM
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
127
click to vote
FC
2007
Springer
15 years 5 months ago
2007
Springer
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
88
Voted
HPDC
2010
IEEE
15 years 21 days ago
2010
IEEE
Grid computing has been widely adopted for intensive high performance computing. Since grid resources are distributed over complex large-scale infrastructures, understanding grid ...
105
click to vote
WWW
2009
ACM
16 years 9 days ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...