Sciweavers

679 search results - page 85 / 136
» Using decision problems in public key cryptography
Sort
View
ATAL
2009
Springer
15 years 8 months ago
Online exploration in least-squares policy iteration
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
Lihong Li, Michael L. Littman, Christopher R. Mans...
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 1 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
ECCV
2010
Springer
15 years 5 months ago
Efficiently Scaling Up Video Annotation with Crowdsourced Marketplaces
Accurately annotating entities in video is labor intensive and expensive. As the quantity of online video grows, traditional solutions to this task are unable to scale to meet the ...
ASIACRYPT
2010
Springer
14 years 11 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert
EOR
2007
68views more  EOR 2007»
15 years 1 months ago
Multiattribute electronic procurement using goal programming
One of the key challenges of current day electronic procurement systems is to enable procurement decisions transcend beyond a single attribute such as cost. Consequently, multiatt...
S. Kameshwaran, Y. Narahari, Charles H. Rosa, Deva...