3395 search results - page 93 / 679 » Learning to efficiently rank |
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
VLDB
1992
ACM
14 years 1 months ago
1992
ACM
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
CIKM
2008
Springer
13 years 11 months ago
2008
Springer
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
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...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...