Sciweavers

3889 search results - page 465 / 778
» A Framework for Optimizing Paper Matching
Sort
View
DPD
2006
141views more  DPD 2006»
15 years 6 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
SIGIR
2011
ACM
14 years 9 months ago
A boosting approach to improving pseudo-relevance feedback
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
Yuanhua Lv, ChengXiang Zhai, Wan Chen
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 8 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
HPCA
2008
IEEE
16 years 7 months ago
Thread-safe dynamic binary translation using transactional memory
Dynamic binary translation (DBT) is a runtime instrumentation technique commonly used to support profiling, optimization, secure execution, and bug detection tools for application...
JaeWoong Chung, Michael Dalton, Hari Kannan, Chris...
VLDB
2006
ACM
124views Database» more  VLDB 2006»
16 years 6 months ago
Dynamic buffer management with extensible replacement policies
The objective of extensible DBMSs is to ease the construction of specialized DBMSs for nontraditional applications. Although much work has been done in providing various levels of ...
Chong Leng Goh, Yanfeng Shu, Zhiyong Huang, Beng C...