-
1
-
-
0038166193
-
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
-
Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. JCSS 66 (2003)
-
(2003)
JCSS
, vol.66
-
-
Achlioptas, D.1
-
2
-
-
37549058056
-
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
-
Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117-122 (2008)
-
(2008)
Commun. ACM
, vol.51
, Issue.1
, pp. 117-122
-
-
Andoni, A.1
Indyk, P.2
-
4
-
-
77953321432
-
Approximating power indices: Theoretical and empirical analysis
-
Bachrach, Y., Markakis, E., Resnick, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices: theoretical and empirical analysis. Autonomous Agents and Multi-Agent Systems 20(2), 105-122 (2010)
-
(2010)
Autonomous Agents and Multi-Agent Systems
, vol.20
, Issue.2
, pp. 105-122
-
-
Bachrach, Y.1
Markakis, E.2
Resnick, E.3
Procaccia, A.D.4
Rosenschein, J.S.5
Saberi, A.6
-
5
-
-
67650110656
-
Gossip-based aggregation of trust in decentralized reputation systems
-
Bachrach, Y., Parnes, A., Procaccia, A.D., Rosenschein, J.S.: Gossip-based aggregation of trust in decentralized reputation systems. Autonomous Agents and Multi-Agent Systems 19(2), 153-172 (2009)
-
(2009)
Autonomous Agents and Multi-Agent Systems
, vol.19
, Issue.2
, pp. 153-172
-
-
Bachrach, Y.1
Parnes, A.2
Procaccia, A.D.3
Rosenschein, J.S.4
-
6
-
-
70350625168
-
Sketching algorithms for approximating rank correlations in collaborative filtering systems
-
Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. Springer, Heidelberg
-
Bachrach, Y., Herbrich, R., Porat, E.: Sketching algorithms for approximating rank correlations in collaborative filtering systems. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 344-352. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5721
, pp. 344-352
-
-
Bachrach, Y.1
Herbrich, R.2
Porat, E.3
-
7
-
-
77957061059
-
Sketching techniques for collaborative filtering
-
July
-
Bachrach, Y., Porat, E., Rosenschein, J.S.: Sketching techniques for collaborative filtering. In: IJCAI 2009, Pasadena, California (July 2009)
-
(2009)
IJCAI 2009, Pasadena, California
-
-
Bachrach, Y.1
Porat, E.2
Rosenschein, J.S.3
-
8
-
-
57349146373
-
Lessons from the netflix prize challenge
-
Bell, R.M., Koren, Y.: Lessons from the netflix prize challenge. SIGKDD Explor. Newsl. 9(2), 75-79 (2007)
-
(2007)
SIGKDD Explor. Newsl.
, vol.9
, Issue.2
, pp. 75-79
-
-
Bell, R.M.1
Koren, Y.2
-
9
-
-
0002051628
-
Empirical analysis of predictive algorithms for collaborative filtering
-
Morgan Kaufmann, San Francisco
-
Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: Proceedings of UAI 1998, pp. 43-52. Morgan Kaufmann, San Francisco (1998)
-
(1998)
Proceedings of UAI 1998
, pp. 43-52
-
-
Breese, J.S.1
Heckerman, D.2
Kadie, C.3
-
10
-
-
0034207121
-
Min-wise independent permutations
-
Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. JCSS 60(3), 630-659 (2000)
-
(2000)
JCSS
, vol.60
, Issue.3
, pp. 630-659
-
-
Broder, A.Z.1
Charikar, M.2
Frieze, A.M.3
Mitzenmacher, M.4
-
11
-
-
38049048802
-
K-mismatch with don't cares
-
Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. Springer, Heidelberg
-
Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: K-mismatch with don't cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 151-162. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4698
, pp. 151-162
-
-
Clifford, R.1
Efremenko, K.2
Porat, E.3
Rothschild, A.4
-
12
-
-
0038633398
-
Comparing data streams using Hamming norms
-
Cormode, G., Datar, M., Indyk, P., Muthukrishnan, S.: Comparing data streams using Hamming norms. IEEE Trans. Knowl. Data Eng. 15(3), 529-540 (2003)
-
(2003)
IEEE Trans. Knowl. Data Eng.
, vol.15
, Issue.3
, pp. 529-540
-
-
Cormode, G.1
Datar, M.2
Indyk, P.3
Muthukrishnan, S.4
-
13
-
-
0037943836
-
An approximate L1-difference algorithm for massive data streams
-
Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: An approximate L1-difference algorithm for massive data streams. SIAM J. Comput 32(1), 131-151 (2002)
-
(2002)
SIAM J. Comput
, vol.32
, Issue.1
, pp. 131-151
-
-
Feigenbaum, J.1
Kannan, S.2
Strauss, M.3
Viswanathan, M.4
-
14
-
-
27844554412
-
The complexity of Kemeny elections
-
Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theoretical Computer Science 349(3), 382-391 (2005)
-
(2005)
Theoretical Computer Science
, vol.349
, Issue.3
, pp. 382-391
-
-
Hemaspaandra, E.1
Spakowski, H.2
Vogel, J.3
-
15
-
-
78449270441
-
An introduction to modern nonparametric statistics
-
Higgins, J.J.: An introduction to modern nonparametric statistics. Thomson Learning (2004)
-
(2004)
Thomson Learning
-
-
Higgins, J.J.1
-
16
-
-
84947403595
-
Probability inequalities for sums of bounded random variables
-
Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13-30 (1963)
-
(1963)
Journal of the American Statistical Association
, vol.58
, Issue.301
, pp. 13-30
-
-
Hoeffding, W.1
-
17
-
-
0344612511
-
A small approximately min-wise independent family of hash functions
-
Indyk, P.: A small approximately min-wise independent family of hash functions. Journal of Algorithms 38(1), 84-90 (2001)
-
(2001)
Journal of Algorithms
, vol.38
, Issue.1
, pp. 84-90
-
-
Indyk, P.1
-
18
-
-
33846834126
-
A survey of trust and reputation systems for online service provision
-
DOI 10.1016/j.dss.2005.05.019, PII S0167923605000849
-
Jusang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decision Support Systems 43(2), 618-644 (2007) (Pubitemid 46216533)
-
(2007)
Decision Support Systems
, vol.43
, Issue.2
, pp. 618-644
-
-
Josang, A.1
Ismail, R.2
Boyd, C.3
-
19
-
-
0002282074
-
A new measure of rank correlation
-
Kendall, M.G.: A new measure of rank correlation. Biometrika 30, 81-93 (1938)
-
(1938)
Biometrika
, vol.30
, pp. 81-93
-
-
Kendall, M.G.1
-
20
-
-
85030174634
-
Grouplens: An open architecture for collaborative filtering of netnews
-
ACM, New York
-
Resnick, P., Iacovou, N., Suchak, M., Bergstorm, P., Riedl, J.: Grouplens: An open architecture for collaborative filtering of netnews. In: Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work, Chapel Hill, North Carolina, pp. 175-186. ACM, New York (1994)
-
(1994)
Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work, Chapel Hill, North Carolina
, pp. 175-186
-
-
Resnick, P.1
Iacovou, N.2
Suchak, M.3
Bergstorm, P.4
Riedl, J.5
-
22
-
-
0029179043
-
Social information filtering: Algorithms for automating "word of mouth"
-
Shardan, U., Maes, P.: Social information filtering: Algorithms for automating "word of mouth". In: ACM CHI 1995, vol. 1, pp. 210-217 (1995)
-
(1995)
ACM CHI 1995
, vol.1
, pp. 210-217
-
-
Shardan, U.1
Maes, P.2
-
23
-
-
0023411964
-
The proof and measurement of association between two things 1904
-
Spearman, C.: The proof and measurement of association between two things 1904. The American Journal of Psychology 100(3-4), 441-471 (1987)
-
(1987)
The American Journal of Psychology
, vol.100
, Issue.3-4
, pp. 441-471
-
-
Spearman, C.1
|