Sciweavers

3360 search results - page 587 / 672
» Opportunistic Data Structures with Applications
Sort
View
142
Voted
C3S2E
2009
ACM
15 years 7 months ago
The promise of solid state disks: increasing efficiency and reducing cost of DBMS processing
Most database systems (DBMSs) today are operating on servers equipped with magnetic disks. In our contribution, we want to motivate the use of two emerging and striking technologi...
Karsten Schmidt 0002, Yi Ou, Theo Härder
132
Voted
COMPSAC
2007
IEEE
15 years 7 months ago
AOP-based automated unit test classification of large benchmarks
Despite the availability of a variety of program analysis tools, evaluation of these tools is difficult, as only few benchmark suites exist. Existing benchmark suites lack the uni...
Cyrille Artho, Zhongwei Chen, Shinichi Honiden
126
Voted
CIKM
2009
Springer
15 years 7 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
113
Voted
CSFW
2010
IEEE
15 years 7 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
137
Voted
HOPL
2007
15 years 7 months ago
The development of the Emerald programming language
Emerald is an object-based programming language and system designed and implemented in the Department of Computer Science at the University of Washington in the early and mid-1980...
Andrew P. Black, Norman C. Hutchinson, Eric Jul, H...