17541 search results - page 453 / 3509 » Complexity in scalable computing |
166
Voted
DCC
1993
IEEE
15 years 10 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
136
click to vote
BMCBI
2008
15 years 6 months ago
2008
ent> <title> <p>Highlights from the Fourth International Society for Computational Biology (ISCB) Student Council Symposium</p> </title> <editor>Lu...
159
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
183
click to vote
ISW
2010
Springer
15 years 4 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
147
click to vote
SPAA
2006
ACM
16 years 7 days ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...