1943 search results - page 248 / 389 » Ordering Default Theories |
171
click to vote
DAC
2005
ACM
16 years 8 months ago
2005
ACM
This paper presents a unifying framework for the modeling of asynchronous pipeline circuits. A pipeline protocol is captured in a graph-based model which defines the partial order...
191
Voted
DAC
2005
ACM
16 years 8 months ago
2005
ACM
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
178
Voted
DAC
2006
ACM
16 years 8 months ago
2006
ACM
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
188
Voted
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
187
Voted
WWW
2007
ACM
16 years 7 months ago
2007
ACM
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...