Sciweavers

10909 search results - page 157 / 2182
» Evaluating Backup Algorithms
Sort
View
SIGIR
2008
ACM
15 years 3 months ago
Evaluation over thousands of queries
Information retrieval evaluation has typically been performed over several dozen queries, each judged to near-completeness. There has been a great deal of recent work on evaluatio...
Ben Carterette, Virgiliu Pavlu, Evangelos Kanoulas...
ICFP
2005
ACM
15 years 9 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
FPL
2004
Springer
103views Hardware» more  FPL 2004»
15 years 9 months ago
Automating Optimized Table-with-Polynomial Function Evaluation for FPGAs
Abstract. Function evaluation is at the core of many compute-intensive applications which perform well on reconfigurable platforms. Yet, in order to implement function evaluation ...
Dong-U Lee, Oskar Mencer, David J. Pearce, Wayne L...
SIGIR
2006
ACM
15 years 10 months ago
Minimal test collections for retrieval evaluation
Accurate estimation of information retrieval evaluation metrics such as average precision require large sets of relevance judgments. Building sets large enough for evaluation of r...
Ben Carterette, James Allan, Ramesh K. Sitaraman
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 4 months ago
Buffering in query evaluation over XML streams
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski