10608 search results - page 149 / 2122 » Complexity of O'Hara's Algorithm |
112
Voted
ALENEX
2010
15 years 2 months ago
2010
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
80
Voted
MASCOTS
2004
15 years 1 months ago
2004
Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs ...
112
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
121
click to vote
COMAD
2009
15 years 1 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
104
Voted
TC
2008
15 years 13 days ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...