Sciweavers

1698 search results - page 127 / 340
» Growing Complex Games
Sort
View
127
Voted
CRYPTO
2008
Springer
76views Cryptology» more  CRYPTO 2008»
15 years 5 months ago
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
Ivan Damgård, Yuval Ishai, Mikkel Krø...
ESANN
2008
15 years 5 months ago
Self-Organizing Maps for cyclic and unbounded graphs
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
ENTCS
2006
112views more  ENTCS 2006»
15 years 4 months ago
Synchronous Dataflow Pattern Matching
We introduce variant types and a pattern matching operation to synchronous dataflow languages. These languages are used in the design of reactive systems. As these systems grow in...
Grégoire Hamon
IJHPCA
2006
73views more  IJHPCA 2006»
15 years 4 months ago
The Tau Parallel Performance System
The ability of performance technology to keep pace with the growing complexity of parallel and distributed systems depends on robust performance frameworks that can at once provid...
Sameer Shende, Allen D. Malony
SIAMAM
2008
75views more  SIAMAM 2008»
15 years 4 months ago
Models of Virulent Phage Growth with Application to Phage Therapy
We modify existing models of bacteriophage growth on an exponentially growing bacterial population by including (1) density dependent phage attack rates and (2) loss to phage due ...
Hal L. Smith