Sciweavers

1846 search results - page 20 / 370
» Generating query substitutions
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Analyzing and evaluating query reformulation strategies in web search logs
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
Jeff Huang, Efthimis N. Efthimiadis
DLOG
2003
13 years 9 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt
SERSCISA
2010
Springer
13 years 9 months ago
A Novel Approach Based on Fault Tolerance and Recursive Segmentation to Query by Humming
With the explosive growth of digital music, content-based music information retrieval especially query by humming/singing have been attracting more and more attention and are beco...
Xiaohong Yang, Qingcai Chen, Xiaolong Wang
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
14 years 7 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
14 years 24 days ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm