Sciweavers

741 search results - page 10 / 149
» Memory Dependence Prediction Using Store Sets
Sort
View
SPIN
2010
Springer
14 years 10 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper
GLOBECOM
2008
IEEE
15 years 6 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
CGF
2000
109views more  CGF 2000»
14 years 11 months ago
External Memory View-Dependent Simplification
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use ...
Jihad El-Sana, Yi-Jen Chiang
ICML
2006
IEEE
16 years 16 days ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
WSCG
2003
177views more  WSCG 2003»
15 years 1 months ago
Efficient NURBS Rendering using View-Dependent LOD and Normal Maps
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
Michael Guthe, Reinhard Klein