4212 search results - page 47 / 843 » On Compressible Pairings and Their Computation |
127
click to vote
IEEESCC
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
ACPC
1999
Springer
15 years 4 months ago
1999
Springer
CSR
2007
Springer
15 years 6 months ago
2007
Springer
APWEB
2006
Springer
15 years 4 months ago
2006
Springer
We give a new view on building content clusters from page pair models. We measure the heuristic importance within every two pages by computing the distance of their accessed positi...
82
Voted
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Code compression has been shown to be an effective technique to reduce code size in memory constrained embedded systems. It has also been used as a way to increase cache hit ratio...