586 search results - page 79 / 118 » Ranking queries on uncertain data |
131
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS...
133
Voted
ISMIR
2004
Springer
15 years 11 months ago
2004
Springer
In the interest of establishing robust benchmarks for search efficiency, we conducted a series of tests on symbolic databases of musical incipits and themes taken from several di...
144
click to vote
CIKM
2009
Springer
16 years 15 days ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
167
click to vote
CIKM
2007
Springer
16 years 3 days ago
2007
Springer
Web search engines consistently collect information about users interaction with the system: they record the query they issued, the URL of presented and selected documents along w...
181
Voted
WSDM
2009
ACM
16 years 22 days ago
2009
ACM
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...