16666 search results - page 264 / 3334 » Descriptive and Computational Complexity |
153
Voted
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
147
click to vote
SIMUTOOLS
2008
15 years 8 months ago
2008
This paper presents an OMNeT-based Framework to simulate large complex storage networks, with its corresponding underlying subsystems (I/O, Networking, etc.). With this Framework,...
180
click to vote
ICDAR
2011
IEEE
14 years 6 months ago
2011
IEEE
—Radial harmonic Fourier moments (RHFMs) are invariant to translation, rotation, scaling and intensity, which own excellent image description ability, noise-resistant power, and ...
197
click to vote
ACRI
2008
Springer
16 years 29 days ago
2008
Springer
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
166
click to vote
JAIR
1998
15 years 6 months ago
1998
As planning is applied to larger and richer domains the e ort involved in constructing domain descriptions increases and becomes a signi cant burden on the human application desig...