Sciweavers

1552 search results - page 193 / 311
» On the Complexity of Constant Propagation
Sort
View
ICISC
2008
126views Cryptology» more  ICISC 2008»
15 years 8 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
METMBS
2003
165views Mathematics» more  METMBS 2003»
15 years 8 months ago
GeneBox: Interactive Visualization of Microarray Data Sets
Abstract Technological advancements are constantly increasing the size and complexity of data resulting from microarray experiments. This fact has led biologists to ask complex que...
Nameeta Shah, Vladimir Filkov, Bernd Hamann, Kenne...
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
15 years 7 months ago
Multi-resistant radar jamming using genetic algorithms
The next generation of advanced self-protection jammers is expected to deliver effective and energy efficient jamming against modern air tracking radars. However, optimizing such ...
Hans Jonas Fossum Moen, Stein Kristoffersen
CORR
2008
Springer
101views Education» more  CORR 2008»
15 years 6 months ago
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
Joshua Brody, Amit Chakrabarti
CORR
2010
Springer
63views Education» more  CORR 2010»
15 years 6 months ago
On Opinion Dynamics in Heterogeneous Networks
This paper studies the opinion dynamics model recently introduced by Hegselmann and Krause: (1) each agent in a group mantains a real number describing its opinion, (2) each agent ...
Anahita Mirtabatabaei, Francesco Bullo