Sciweavers

227 search results - page 38 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
EUROCRYPT
2004
Springer
15 years 4 months ago
Merkle Tree Traversal in Log Space and Time
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 ...
Michael Szydlo
LCPC
2000
Springer
15 years 2 months ago
Improving Offset Assignment for Embedded Processors
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...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
84
Voted
ICIP
2005
IEEE
16 years 23 days ago
Correlation estimation for distributed source coding under information exchange constraints
Distributed source coding (DSC) depends strongly on accurate knowledge of correlation between sources. Previous works have reported capacity-approaching code constructions when ex...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega
ADBIS
2006
Springer
182views Database» more  ADBIS 2006»
15 years 5 months ago
A Middleware-Based Approach to Database Caching
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-...
Andreas Bühmann, Theo Härder, Christian ...
SPAA
2010
ACM
15 years 3 months ago
Tree network coding for peer-to-peer networks
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...
Arne Vater, Christian Schindelhauer, Christian Ort...