1778 search results - page 147 / 356 » On the Power of the Randomized Iterate |
194
click to vote
PAIRING
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
152
click to vote
DLT
2004
15 years 7 months ago
2004
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying ...
193
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
162
click to vote
DSN
2008
IEEE
16 years 27 days ago
2008
IEEE
A method for Statistical Fault Injection (SFI) into arbitrary latches within a full system hardware-emulated model is validated against particle-beam-accelerated SER testing for a...
137
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...