1127 search results - page 27 / 226 » Value Compression for Efficient Computation |
164
click to vote
TVLSI
2010
14 years 8 months ago
2010
Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memor...
113
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
102
click to vote
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper presents a cascaded scheme with block-based and pixel-based codebooks for background subtraction. The codebook is mainly used to compress information to achieve high ef...
107
click to vote
KDD
2005
ACM
16 years 1 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
141
click to vote
CASES
2005
ACM
15 years 3 months ago
2005
ACM
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...