Sciweavers

203 search results - page 35 / 41
» A Linear Metalanguage for Concurrency
Sort
View
VTC
2010
IEEE
114views Communications» more  VTC 2010»
13 years 5 months ago
On Non-Stationary Urban Macrocell Channels in a Cooperative Downlink Beamforming Scenario
—A common simplification in the treatment of random linear channels is the assumption of stationarity of the channel in time. The wireless channel is, however, known to be inher...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
WDAG
2010
Springer
204views Algorithms» more  WDAG 2010»
13 years 5 months ago
The Cost of Privatization
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically. In practice, it is impor...
Hagit Attiya, Eshcar Hillel
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
13 years 5 months ago
Using Strategy Objectives for Network Security Analysis
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...
Elie Bursztein, John C. Mitchell
ERSA
2009
149views Hardware» more  ERSA 2009»
13 years 5 months ago
Hardware-Optimized Ziggurat Algorithm for High-Speed Gaussian Random Number Generators
Many scientific and engineering applications, which are increasingly being ported from software to reconfigurable platforms, require Gaussian-distributed random numbers. Thus, the...
Hassan Edrees, Brian Cheung, McCullen Sandora, Dav...
FOCS
2009
IEEE
14 years 2 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra