407 search results - page 39 / 82 » On sequential functionals of type 3 |
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
105
Voted
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
The parallel realization of adaptive finite element methods (FEM) has to deal with several irregular and dynamic algorithmic properties caused by adaptive mesh refinement (AMR). ...
121
click to vote
SSPR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We investigate a number of approaches to pose invariant face recognition. Basically, the methods involve three sequential functions for capturing nonlinear manifolds of f...
121
click to vote
FTDCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We describe an environment for distributed computing that uses the concept of well-known paradigms. The main advantage of paradigmoriented distributed computing (PODC) is that the...
125
click to vote
CRYPTO
2006
Springer
15 years 6 months ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...