Sciweavers

99 search results - page 18 / 20
» Practical Programming with Higher-Order Encodings and Depend...
Sort
View
TGC
2005
Springer
13 years 11 months ago
Mixin Modules for Dynamic Rebinding
Dynamic rebinding is the ability of changing the definitions of names at execution time. While dynamic rebinding is clearly useful in practice, and increasingly needed in modern s...
Davide Ancona, Sonia Fagorzi, Elena Zucca
POPL
2002
ACM
14 years 6 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...
ICALP
2005
Springer
13 years 11 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
14 years 16 days ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee
CIKM
2009
Springer
14 years 10 days ago
Post-rank reordering: resolving preference misalignments between search engines and end users
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
Chao Liu, Mei Li, Yi-Min Wang