Sciweavers

16430 search results - page 603 / 3286
» On Computable Tree Functions
Sort
View
JACIII
2007
99views more  JACIII 2007»
15 years 7 months ago
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...
DAC
2009
ACM
16 years 8 months ago
Nanoscale digital computation through percolation
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
Mustafa Altun, Marc D. Riedel, Claudia Neuhauser
DATE
2008
IEEE
107views Hardware» more  DATE 2008»
16 years 1 months ago
Merged Computation for Whirlpool Hashing
This paper presents an improved hardware structure for the computation of the Whirlpool hash function. By merging the round key computation with the data compression and by using ...
Ricardo Chaves, Georgi Kuzmanov, Leonel Sousa, Sta...
ARCS
2005
Springer
16 years 21 days ago
A File System for System Programming in Ubiquitous Computing
In Ubiquitous computing small embedded sensor and computing nodes are the main enabling technologies. System programming for such small embedded systems is a challenging task invol...
Christian Decker, Michael Beigl, Albert Krohn
CIE
2005
Springer
16 years 21 days ago
A Network Model of Analogue Computation over Metric Algebras
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
J. V. Tucker, Jeffery I. Zucker