149 search results - page 22 / 30 » What will they say |
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...
AO
2006
13 years 7 months ago
2006
in ontology is quite abstract and often based on toy-examples to the point that the gap between the work of theoreticians and the needs of real applications is too wide to be cross...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
HRI
2007
ACM
13 years 11 months ago
2007
ACM
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...