4747 search results - page 594 / 950 » Shuffle Memory System |
170
click to vote
VLSID
2009
IEEE
16 years 7 months ago
2009
IEEE
Code compression is important in embedded systems design since it reduces the code size (memory requirement) and thereby improves overall area, power and performance. Existing res...
189
click to vote
KDD
2009
ACM
16 years 7 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...
246
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
283
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
148
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...