2924 search results - page 325 / 585 » Lower Bounds in Distributed Computing |
165
Voted
TDSC
2011
14 years 11 months ago
2011
High-end enterprise storage has traditionally consisted of monolithic systems with customized hardware, multiple redundant components and paths, and no single point of failure. Di...
130
click to vote
ASAP
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we analyze the theoretical delay bound of the SHA-1 algorithm and propose architectures to achieve high throughput hardware implementations which approach this boun...
154
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
142
Voted
TCC
2010
Springer
16 years 1 months ago
2010
Springer
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
126
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
— In IEEE 802.11 wireless networks, EDCA users’ performance may be degraded because of the existence of legacy users and therefore would get a lower priority service. Such effe...