Sciweavers

8695 search results - page 314 / 1739
» Making the Complex Simple
Sort
View
CORR
2004
Springer
133views Education» more  CORR 2004»
15 years 6 months ago
Mathematical Analysis of Multi-Agent Systems
We propose a general mathematical methodology for studying the dynamics of multiagent systems in which complex collective behavior arises out of local interactions between many si...
Kristina Lerman, Aram Galstyan, Tad Hogg
CORR
2004
Springer
98views Education» more  CORR 2004»
15 years 6 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui
JSAC
2000
97views more  JSAC 2000»
15 years 6 months ago
A differential detection scheme for transmit diversity
Abstract--We present a transmission scheme for exploiting diversity given by two transmit antennas when neither the transmitter nor the receiver has access to channel state informa...
Vahid Tarokh, Hamid Jafarkhani
TCC
2010
Springer
175views Cryptology» more  TCC 2010»
15 years 5 months ago
Obfuscation of Hyperplane Membership
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
Ran Canetti, Guy N. Rothblum, Mayank Varia
FSTTCS
2010
Springer
15 years 4 months ago
Fast equivalence-checking for normed context-free processes
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
Wojciech Czerwinski, Slawomir Lasota