Sciweavers

4850 search results - page 893 / 970
» Approximate Data Structures with Applications
Sort
View
COMPSAC
2007
IEEE
15 years 1 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
CIKM
2009
Springer
15 years 1 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...
HOPL
2007
15 years 1 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...
CGI
2004
IEEE
15 years 1 months ago
Surface Models of Tube Trees
This paper describes a new method for generating surfaces of branching tubular structures with given centerlines and radii. As the centerlines are not straight lines, the cross-se...
Petr Felkel, Rainer Wegenkittl, Katja Bühler
CSFW
2004
IEEE
15 years 1 months ago
Secure Information Flow by Self-Composition
Non-interference is a high-level security property that guarantees the absence of illicit information leakages through executing programs. More precisely, non-interference for a p...
Gilles Barthe, Pedro R. D'Argenio, Tamara Rezk