Sciweavers

137 search results - page 3 / 28
» Cross-Serial Dependencies Are Not Hard to Process
Sort
View
PVLDB
2008
123views more  PVLDB 2008»
14 years 9 months ago
Dependable cardinality forecasts for XQuery
Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By...
Jens Teubner, Torsten Grust, Sebastian Maneth, She...
SIGIR
2009
ACM
15 years 3 months ago
Query dependent pseudo-relevance feedback based on wikipedia
Pseudo-relevance feedback (PRF) via query-expansion has been proven to be effective in many information retrieval (IR) tasks. In most existing work, the top-ranked documents from...
Yang Xu, Gareth J. F. Jones, Bin Wang
81
Voted
SIGCOMM
2009
ACM
15 years 3 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
NIPS
2004
14 years 10 months ago
Experts in a Markov Decision Process
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
Eyal Even-Dar, Sham M. Kakade, Yishay Mansour
114
Voted
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 28 days ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...