Sciweavers

1088 search results - page 11 / 218
» Probabilistic query expansion using query logs
Sort
View
ICRA
2007
IEEE
125views Robotics» more  ICRA 2007»
14 years 3 months ago
Single-Query Motion Planning with Utility-Guided Random Trees
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
Brendan Burns, Oliver Brock
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 8 months ago
Comparing and Combining Methods for Automatic Query Expansion
Abstract. Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candid...
José R. Pérez-Agüera, Lourdes A...
WWW
2009
ACM
14 years 9 months ago
Online expansion of rare queries for sponsored search
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety...
Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovi...
SIGIR
2008
ACM
13 years 8 months ago
Query-drift prevention for robust query expansion
Pseudo-feedback-based automatic query expansion yields effective retrieval performance on average, but results in performance inferior to that of using the original query for many...
Liron Zighelnic, Oren Kurland
ICASSP
2009
IEEE
14 years 3 months ago
Leveraging multiple query logs to improve language models for spoken query recognition
A voice search system requires a speech interface that can correctly recognize spoken queries uttered by users. The recognition performance strongly relies on a robust language mo...
Xiao Li, Patrick Nguyen, Geoffrey Zweig, Dan Bohus