1653 search results - page 149 / 331 » Adversarial Sequence Prediction |
176
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
152
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Many network processing applications require wirespeed access to large data structures or a large amount of flowlevel data, but the capacity of SRAMs is woefully inadeq...
151
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
210
click to vote
ICDCS
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exc...
171
click to vote
ISBRA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We investigate the problem of inferring contiguous ancestral regions (CARs) of the genome of the last common ancestor of all extant amniotes, based on the currently seque...