Sciweavers

672 search results - page 103 / 135
» Almost Optimal Dispersers
Sort
View
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
13 years 10 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
BPM
2008
Springer
132views Business» more  BPM 2008»
13 years 10 months ago
On Modeling and Maximizing Business Value for Autonomic Service-Oriented Systems
Abstract. The existing Web service management solutions are almost exclusively focused on optimization of technical QoS metrics (e.g., availability). However, financial (e.g., prof...
Vladimir Tosic
CLUSTER
2008
IEEE
13 years 10 months ago
Improving message passing over Ethernet with I/OAT copy offload in Open-MX
Abstract--Open-MX is a new message passing layer implemented on top of the generic Ethernet stack of the Linux kernel. Open-MX works on all Ethernet hardware, but it suffers from e...
Brice Goglin
FSE
2008
Springer
166views Cryptology» more  FSE 2008»
13 years 10 months ago
Accelerating the Whirlpool Hash Function Using Parallel Table Lookup and Fast Cyclical Permutation
Hash functions are an important building block in almost all security applications. In the past few years, there have been major advances in the cryptanalysis of hash functions, es...
Yedidya Hilewitz, Yiqun Lisa Yin, Ruby B. Lee
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...