385 search results - page 33 / 77 » Probabilistic ranking over relations |
WWW
2010
ACM
15 years 4 months ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
105
click to vote
PVLDB
2010
14 years 8 months ago
2010
Recently, there has been increasing interest in extending relational query processing to include data obtained from unstructured sources. A common approach is to use stand-alone I...
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
112
click to vote
PKDD
2004
Springer
15 years 3 months ago
2004
Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
AMR
2006
Springer
15 years 1 months ago
2006
Springer
This work presents a discriminative model for the retrieval of pictures from text queries. The core idea of this approach is to minimize a loss directly related to the retrieval pe...