Sciweavers

1670 search results - page 153 / 334
» On Skolemization in constructive theories
Sort
View
PPDP
2009
Springer
15 years 11 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
15 years 10 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
CIKM
2008
Springer
15 years 8 months ago
Summarization of social activity over time: people, actions and concepts in dynamic networks
We present a framework for automatically summarizing social group activity over time. The problem is important in understanding large scale online social networks, which have dive...
Yu-Ru Lin, Hari Sundaram, Aisling Kelliher
EUROCRYPT
2008
Springer
15 years 8 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
IJCAI
1993
15 years 7 months ago
A Scheme for Agent Collaboration in Open Multiagent Environments
In multiagent planning, an agent sometimes needs to collaborate with others to construct complex plans, or to accomplish large organizational tasks which it cannot do alone. Since...
Eiichi Osawa