721 search results - page 92 / 145 » Graphs with Large Obstacle Numbers |
118
click to vote
ASYNC
2001
IEEE
15 years 8 months ago
2001
IEEE
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...
157
click to vote
CVIU
2008
15 years 4 months ago
2008
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
148
click to vote
JDA
2006
15 years 4 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
137
click to vote
HPCA
2006
IEEE
16 years 4 months ago
2006
IEEE
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
159
click to vote
HIPEAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Iterative compilation is an efficient approach to optimize programs on rapidly evolving hardware, but it is still only scarcely used in practice due to a necessity to gat...