111 search results - page 3 / 23 » Analysis of Branch Prediction Via Data Compression |
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this digital era, digital multimedia contents are often transmitted over networks without any protection. This raises serious security concerns since the receivers/subscribers ...
CGO
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, ...
IPL
2006
13 years 7 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...