1066 search results - page 81 / 214 » Computing Private Set Operations with Linear Complexities |
156
Voted
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
113
Voted
NDSS
2008
IEEE
15 years 9 months ago
2008
IEEE
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
119
Voted
AAAI
2006
15 years 4 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
138
Voted
ACMSE
2010
ACM
14 years 9 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
136
Voted
NIPS
1997
15 years 4 months ago
1997
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...