26 search results - page 4 / 6 » Cache-Friendly implementations of transitive closure |
CAV
2009
Springer
13 years 11 months ago
2009
Springer
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Existing data cleaning methods work on the basis of computing the degree of similarity between nearby records in a sorted database. High recall is achieved by accepting records wi...
DBA
2006
13 years 9 months ago
2006
: Recursive queries are required in many object-oriented database applications. Among them we can mention Bill-Of-Material (BOM), stock market dependencies, various kinds of networ...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract- This paper describes the implementation of an areaefficient and protected user memory-mapped network interface, the pbuf (Parcel Buffer), for the Data IntensiVe Architect...