Sciweavers

3750 search results - page 670 / 750
» Code Optimization for Code Compression
Sort
View
124
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
Calysto: scalable and precise extended static checking
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
Domagoj Babic, Alan J. Hu
108
Voted
RECOMB
2006
Springer
16 years 2 months ago
Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes
Micro-indels are small insertion or deletion events (indels) that occur during genome evolution. The study of micro-indels is important, both in order to better understand the unde...
Sagi Snir, Lior Pachter
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 2 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
16 years 2 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
113
Voted
ICFP
2003
ACM
16 years 2 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones