Iadh Ounis

Latest

• Efficient Query Processing for Scalable Web Search
• Efficient & Effective Selective Query Rewriting with Efficiency Predictions
• Queuing Theory-based Latency/Power Tradeoff Models for Replicated Search Engines
• Towards Green Information Retrieval: Studying the Suitability of Queueing Theory in Reducing Power Consumption
• A Self-Adapting Latency/Power Tradeoff Model for Replicated Search Engines
• Load-Sensitive Selective Pruning for Distributed Search
• Query Processing in Highly-Loaded Search Engines
• Hybrid Query Scheduling for a Replicated Search Engine
• Efficient and effective retrieval using selective pruning
• Effect of Dynamic Pruning Safety on Learning to Rank Effectiveness
• Learning to Predict Response Times for Online Query Scheduling
• Scheduling Queries Across Replicas
• On Upper Bounds for Dynamic Pruning
• Effect of Different Docid Orderings on Dynamic Pruning Retrieval Strategies
• Upper-bound Approximations for Dynamic Pruning