-
2
-
-
84859170480
-
Efficient search for the top-k probable nearest neighbors in uncertain databases
-
G. Beskales, M. Soliman, and I. IIyas. Efficient search for the top-k probable nearest neighbors in uncertain databases. VLDB, 2008.
-
(2008)
VLDB
-
-
Beskales, G.1
Soliman, M.2
Iiyas, I.3
-
3
-
-
33749637514
-
The Gauss-tree: Efficient object identification in databases of probabilistic feature vectors
-
C. Bohm, A. Pryakhin, and M. Schubert. The Gauss-tree: Efficient object identification in databases of probabilistic feature vectors. In ICDE, 2006.
-
(2006)
ICDE
-
-
Bohm, C.1
Pryakhin, A.2
Schubert, M.3
-
4
-
-
52649165058
-
Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data
-
R. Cheng, J. Chen, M. Mokbel, and C. Chow. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In ICDE, 2008.
-
(2008)
ICDE
-
-
Cheng, R.1
Chen, J.2
Mokbel, M.3
Chow, C.4
-
5
-
-
70349103656
-
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
-
R. Cheng, L. Chen, J. Chen, X. Xie. Evaluating probability threshold k-nearest-neighbor queries over uncertain data. In EDBT, 2009.
-
(2009)
EDBT
-
-
Cheng, R.1
Chen, L.2
Chen, J.3
Xie, X.4
-
6
-
-
67649643456
-
Semantics of ranking queries for probabilistic data and expected ranks
-
G. Cormode, F. Li, and K. Yi. Semantics of ranking queries for probabilistic data and expected ranks. In ICDE, 2009.
-
(2009)
ICDE
-
-
Cormode, G.1
Li, F.2
Yi, K.3
-
7
-
-
84859236532
-
An optimal algorithm for Monte Carlo estimation
-
P. Dagum, R. Karp, M. Luby, and S. Ross. An optimal algorithm for Monte Carlo estimation. In FOCS, 1995.
-
(1995)
FOCS
-
-
Dagum, P.1
Karp, R.2
Luby, M.3
Ross, S.4
-
9
-
-
77954442172
-
Model-driven data acquisition in sensor networks
-
A. Deshpande, C. Guestrin, S. Madden, J. M. Hellerstein, W. Hong. Model-driven data acquisition in sensor networks. In VLDB, 2004.
-
(2004)
VLDB
-
-
Deshpande, A.1
Guestrin, C.2
Madden, S.3
Hellerstein, J.M.4
Hong, W.5
-
10
-
-
70849108163
-
Top-k queries on uncertain data: on score distribution and typical answers
-
T. Ge, S. Zdonik, and S. Madden. Top-k queries on uncertain data: on score distribution and typical answers. In SIGMOD, 2009.
-
(2009)
SIGMOD
-
-
Ge, T.1
Zdonik, S.2
Madden, S.3
-
12
-
-
57349126318
-
Learning to rank with softrank and gaussian processes
-
J. Guiver and E. Snelson. Learning to rank with softrank and gaussian processes. In SIGIR, 2008.
-
(2008)
SIGIR
-
-
Guiver, J.1
Snelson, E.2
-
13
-
-
57149131668
-
Ranking queries on uncertain data: A probabilistic threshold approach
-
M. Hua, J. Pei, W. Zhang, and X. Lin. Ranking queries on uncertain data: A probabilistic threshold approach. In SIGMOD, 2008.
-
(2008)
SIGMOD
-
-
Hua, M.1
Pei, J.2
Zhang, W.3
Lin, X.4
-
14
-
-
55349093583
-
A survey of top-k query processing techniques in relational database systems
-
I. Ilyas, G. Beskales, and M. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys, 2008.
-
(2008)
ACM Computing Surveys
-
-
Ilyas, I.1
Beskales, G.2
Soliman, M.3
-
15
-
-
1842637192
-
Cumulated gain-based evaluation of ir techniques
-
K. Järvelin and J. Kekäläinen. Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst., 20(4), 2002.
-
(2002)
ACM Trans. Inf. Syst.
, vol.20
, Issue.4
-
-
Järvelin, K.1
Kekäläinen, J.2
-
16
-
-
0002282074
-
A new measure of rank correlation
-
M. Kendall. A new measure of rank correlation. Biometrica, 1938.
-
(1938)
Biometrica
-
-
Kendall, M.1
-
17
-
-
43349106519
-
Probabilistic nearest-neighbor query on uncertain objects
-
H.P. Kriegel, P. Kunath, M. Renz. Probabilistic nearest-neighbor query on uncertain objects. In DASFAA, 2007.
-
(2007)
DASFAA
-
-
Kriegel, H.P.1
Kunath, P.2
Renz, M.3
-
18
-
-
77952252122
-
A unified approach to ranking in probabilistic databases
-
J. Li, B. Saha, and A. Deshpande. A unified approach to ranking in probabilistic databases. In VLDB, 2009.
-
(2009)
VLDB
-
-
Li, J.1
Saha, B.2
Deshpande, A.3
-
19
-
-
70350660784
-
Consensus answers for queries over probabilistic databases
-
J. Li and A. Deshpande. Consensus answers for queries over probabilistic databases. In PODS, 2009.
-
(2009)
PODS
-
-
Li, J.1
Deshpande, A.2
-
21
-
-
0001473437
-
On estimation of a probability density function and mode
-
E. Parzen. On estimation of a probability density function and mode. Ann. Math. Stat., 33:1065-1076, 1962.
-
(1962)
Ann. Math. Stat.
, vol.33
, pp. 1065-1076
-
-
Parzen, E.1
-
23
-
-
34548724406
-
Top-k query processing in uncertain databases
-
M. Soliman, I. Ilyas, and K. C. Chang. Top-k query processing in uncertain databases. In ICDE, 2007.
-
(2007)
ICDE
-
-
Soliman, M.1
Ilyas, I.2
Chang, K.C.3
-
24
-
-
67649637320
-
Ranking with uncertain scores
-
M. Soliman and I. Ilyas. Ranking with uncertain scores. In ICDE, pages 317-328, 2009.
-
(2009)
ICDE
, pp. 317-328
-
-
Soliman, M.1
Ilyas, I.2
-
27
-
-
77954736324
-
PODS: a new model and processing algorithms for uncertain data streams
-
T. Tran, L. Peng, B. Li, Y. Diao, and A. Liu. PODS: a new model and processing algorithms for uncertain data streams. In SIGMOD, 2010.
-
(2010)
SIGMOD
-
-
Tran, T.1
Peng, L.2
Li, B.3
Diao, Y.4
Liu, A.5
-
28
-
-
51149107502
-
Efficient processing of top-k queries in uncertain databases
-
K. Yi, F. Li, D. Srivastava, and G. Kollios. Efficient processing of top-k queries in uncertain databases. In ICDE, 2008.
-
(2008)
ICDE
-
-
Yi, K.1
Li, F.2
Srivastava, D.3
Kollios, G.4
-
29
-
-
67649671706
-
On the semantics and evaluation of top-k queries in probabilistic databases
-
X. Zhang and J. Chomicki. On the semantics and evaluation of top-k queries in probabilistic databases. In DBRank, 2008.
-
(2008)
DBRank
-
-
Zhang, X.1
Chomicki, J.2
-
30
-
-
80053192918
-
Ranking under uncertainty
-
O. Zuk, L. Ein-Dor, and E. Domany. Ranking under uncertainty. In UAI, pages 466-473, 2007.
-
(2007)
UAI
, pp. 466-473
-
-
Zuk, O.1
Ein-Dor, L.2
Domany, E.3
|