4759 search results - page 784 / 952 » Parallelizing the Phylogeny Problem |
204
click to vote
PODC
2006
ACM
16 years 11 days ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
152
click to vote
PODC
2006
ACM
16 years 11 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
174
click to vote
PODC
2006
ACM
16 years 11 days ago
2006
ACM
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
214
click to vote
PPOPP
2006
ACM
16 years 11 days ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
183
click to vote
SPAA
2006
ACM
16 years 11 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...