16430 search results - page 597 / 3286 » On Computable Tree Functions |
187
Voted
JCP
2008
15 years 7 months ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
175
click to vote
PPAM
2005
Springer
16 years 18 days ago
2005
Springer
We propose a new framework, named Simple Interface for Library Collections (SILC), that gives users access to matrix computation libraries in a flexible and environment-independen...
211
click to vote
EUROCRYPT
2004
Springer
16 years 15 days ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
191
Voted
ARITH
2003
IEEE
16 years 13 days ago
2003
IEEE
A high-radix composite algorithm for the computation of the powering function (¤¦¥ ) is presented in this paper. The algorithm consists of a sequence of overlapped operations: ...
204
click to vote
FCSC
2008
15 years 7 months ago
2008
We present a computing environment for origami on the web. The environment consists of the computational origami engine Eos for origami construction, visualization, and geometrical...