Sciweavers

218 search results - page 40 / 44
» Generating Compiler Optimizations from Proofs
Sort
View
AGTIVE
2007
Springer
14 years 2 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß
TJS
2002
83views more  TJS 2002»
13 years 7 months ago
An I/O-Conscious Tiling Strategy for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due ...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
VLDB
2004
ACM
245views Database» more  VLDB 2004»
14 years 1 months ago
A Multi-Purpose Implementation of Mandatory Access Control in Relational Database Management Systems
Mandatory Access Control (MAC) implementations in Relational Database Management Systems (RDBMS) have focused solely on Multilevel Security (MLS). MLS has posed a number of challe...
Walid Rjaibi, Paul Bird
SIGPLAN
2002
13 years 7 months ago
Write barrier removal by static analysis
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...
Karen Zee, Martin C. Rinard
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra