Sciweavers

9683 search results - page 410 / 1937
» Predicting query performance
Sort
View
CIKM
2009
Springer
15 years 10 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
PVLDB
2008
100views more  PVLDB 2008»
15 years 6 months ago
Scalable query result caching for web applications
The backend database system is often the performance bottleneck when running web applications. A common approach to scale the database component is query result caching, but it fa...
Charles Garrod, Amit Manjhi, Anastasia Ailamaki, B...
ICML
2005
IEEE
16 years 7 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
KDD
2001
ACM
153views Data Mining» more  KDD 2001»
16 years 7 months ago
Evaluation of prediction models for marketing campaigns
We consider prediction-model evaluation in the context of marketing-campaign planning. In order to evaluate and compare models with specific campaign objectives in mind, we need t...
Saharon Rosset, Einat Neumann, Uri Eick, Nurit Vat...
168
Voted
CHARME
2005
Springer
136views Hardware» more  CHARME 2005»
16 years 12 days ago
Predictive Reachability Using a Sample-Based Approach
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...