779 search results - page 47 / 156 » Ranking distributed probabilistic data |
IJCV
2000
14 years 9 months ago
2000
We propose a Bayesian framework for representing and recognizing local image motion in terms of two basic models: translational motion and motion boundaries. Motion boundaries are ...
175
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
154
click to vote
VLDB
2009
ACM
15 years 10 months ago
2009
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
101
click to vote
KDD
2010
ACM
14 years 8 months ago
2010
ACM
In this paper, we define and study a new opinionated text data analysis problem called Latent Aspect Rating Analysis (LARA), which aims at analyzing opinions expressed about an e...