Sciweavers

7776 search results - page 1248 / 1556
» Maintaining Maintainability
Sort
View
SPAA
2009
ACM
16 years 7 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
PODC
2009
ACM
16 years 7 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
HPCA
2009
IEEE
16 years 7 months ago
Bridging the computation gap between programmable processors and hardwired accelerators
New media and signal processing applications demand ever higher performance while operating within the tight power constraints of mobile devices. A range of hardware implementatio...
Kevin Fan, Manjunath Kudlur, Ganesh S. Dasika, Sco...
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 7 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
16 years 7 months ago
Towards a Theory of Extractable Functions
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
Ran Canetti, Ronny Ramzi Dakdouk
« Prev « First page 1248 / 1556 Last » Next »