779 search results - page 103 / 156 » Ranking distributed probabilistic data |
127
click to vote
WSDM
2010
ACM
15 years 9 months ago
2010
ACM
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
117
click to vote
KDD
2007
ACM
16 years 8 days ago
2007
ACM
Multinomial distributions over words are frequently used to model topics in text collections. A common, major challenge in applying all such topic models to any text mining proble...
110
click to vote
DIS
2008
Springer
15 years 1 months ago
2008
Springer
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
115
click to vote
PODS
2008
ACM
16 years 4 hour ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper, the computation of likelihood of block motion candidates is considered. The method is based on the evaluation of the sum of squared differences (SSD) measure for lo...