5964 search results - page 1109 / 1193 » A theory of speculative computation |
155
click to vote
PODC
2012
ACM
13 years 3 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
111
Voted
ACL
2012
13 years 2 months ago
2012
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...
110
Voted
TEC
2012
13 years 2 months ago
2012
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
102
Voted
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
112
click to vote
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...