Sciweavers

3946 search results - page 165 / 790
» The computational complexity of choice sets
Sort
View
IACR
2011
94views more  IACR 2011»
14 years 6 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
PVLDB
2008
116views more  PVLDB 2008»
15 years 6 months ago
Accuracy estimate and optimization techniques for SimRank computation
The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of th...
Dmitry Lizorkin, Pavel Velikhov, Maxim N. Grinev, ...
ICDCS
2011
IEEE
14 years 6 months ago
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
Ning Cao, Zhenyu Yang, Cong Wang, Kui Ren, Wenjing...
IUI
2009
ACM
16 years 3 months ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu
ATAL
2007
Springer
16 years 23 days ago
Batch reinforcement learning in a complex domain
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
Shivaram Kalyanakrishnan, Peter Stone