Sciweavers

2038 search results - page 392 / 408
» Loops under Strategies
Sort
View
CL
2010
Springer
13 years 8 months ago
Isolating untrusted software extensions by custom scoping rules
In a modern programming language, scoping rules determine the visibility of names in various regions of a program [15]. In this work, we examine the idea of allowing an applicatio...
Philip W. L. Fong, Simon A. Orr
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Distributed Storage Codes Meet Multiple-Access Wiretap Channels
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 8 months ago
Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks
Vehicle-to-roadside (V2R) communications enable vehicular networks to support a wide range of applications for enhancing the efficiency of road transportation. While existing work...
Walid Saad, Zhu Han, Are Hjørungnes, Dusit ...
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 8 months ago
Sub-Nyquist Sampling of Short Pulses: Part I
We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sam...
Ewa Matusiak, Yonina C. Eldar