10988 search results - page 2125 / 2198 » Algorithmic Folding Complexity |
146
click to vote
EMSOFT
2004
Springer
15 years 8 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
138
Voted
EUROCRYPT
2004
Springer
15 years 8 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
151
Voted
GI
2004
Springer
15 years 8 months ago
2004
Springer
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
129
Voted
IWQOS
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
133
Voted
JELIA
2004
Springer
15 years 8 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...