1923 search results - page 171 / 385 » Modeling Complexity in Secure Distributed Computing |
102
click to vote
IACR
2011
13 years 9 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
WSC
2008
15 years 10 days ago
2008
Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their...
108
click to vote
DIS
2009
Springer
15 years 4 months ago
2009
Springer
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
111
click to vote
CCS
2010
ACM
14 years 10 months ago
2010
ACM
Models based on system calls are a popular and common approach to characterize the run-time behavior of programs. For example, system calls are used by intrusion detection systems...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...