14158 search results - page 2584 / 2832 » Generalized switch-setting problems |
147
Voted
TCC
2009
Springer
16 years 5 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
145
click to vote
PKC
2009
Springer
16 years 5 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
156
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
145
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
149
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, ...