227 search results - page 38 / 46 » Complexity Results for Compressing Optimal Paths |
114
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
169
click to vote
LCPC
2000
Springer
15 years 7 months ago
2000
Springer
Embedded systems consisting of the application program ROM, RAM, the embedded processor core, and any custom hardware on a single wafer are becoming increasingly common in applicat...
126
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
Distributed source coding (DSC) depends strongly on accurate knowledge of correlation between sources. Previous works have reported capacity-approaching code constructions when ex...
135
click to vote
ADBIS
2006
Springer
15 years 9 months ago
2006
Springer
Database caching supports declarative query processing close to the application. Using a full-fledged DBMS as cache manager, it enables the evaluation of specific project-select-...
142
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...