2924 search results - page 146 / 585 » Lower Bounds in Distributed Computing |
101
Voted
PAIRING
2010
Springer
14 years 11 months ago
2010
Springer
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
104
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
112
click to vote
COMCOM
2004
15 years 18 days ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
115
Voted
DATAMINE
2006
15 years 24 days ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...