Sciweavers

1729 search results - page 345 / 346
» Deterministic Expressions in C
Sort
View
PODC
2012
ACM
11 years 8 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
11 years 8 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart
EUROCRYPT
2012
Springer
11 years 8 months ago
Fully Homomorphic Encryption with Polylog Overhead
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
Craig Gentry, Shai Halevi, Nigel P. Smart
AIIDE
2008
13 years 8 months ago
Dynamic Expansion of Behaviour Trees
Artificial intelligence in games is typically used for creating player's opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cum...
Gonzalo Flórez Puga, Marco Antonio Gó...
BMCBI
2008
129views more  BMCBI 2008»
13 years 5 months ago
EMAAS: An extensible grid-based Rich Internet Application for microarray data analysis and management
Background: Microarray experimentation requires the application of complex analysis methods as well as the use of non-trivial computer technologies to manage the resultant large d...
Geraint Barton, J. C. Abbott, Norie Chiba, D. W. H...