90 search results - page 8 / 18 » Probabilistic Ranking Queries on Gaussians |
WWW
2005
ACM
14 years 28 days ago
2005
ACM
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
VLDB
2004
ACM
14 years 22 days ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
SIGIR
2005
ACM
14 years 28 days ago
2005
ACM
A query independent feature, relating perhaps to document content, linkage or usage, can be transformed into a static, per-document relevance weight for use in ranking. The challe...