3616 search results - page 200 / 724 » Conditional Memory Ordering |
166
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
: A new technique is presented in this paper to improve the efficiency of data scheduling for multi-context reconfigurable architectures targeting multimedia and DSP applications. ...
162
click to vote
WIA
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
158
Voted
POPL
1998
ACM
15 years 10 months ago
1998
ACM
Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfort...
167
click to vote
CPE
1998
Springer
15 years 10 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
169
click to vote
3DPVT
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we propose a viewer for huge point-sampled models by combining out-of-core technologies with view-dependent level-of-detail (LOD) control. This viewer is designed o...