Sciweavers

4940 search results - page 984 / 988
» On the Complexity of Universal Programs
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 4 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
JMLR
2010
148views more  JMLR 2010»
13 years 4 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
TCBB
2010
144views more  TCBB 2010»
13 years 4 months ago
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
Guillaume Blin, Florian Sikora, Stéphane Vi...
TIT
2010
128views Education» more  TIT 2010»
13 years 4 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
TON
2010
210views more  TON 2010»
13 years 4 months ago
A New Approach to Optical Networks Security: Attack-Aware Routing and Wavelength Assignment
Abstract-- Security issues and attack management in transparent WDM (Wavelength Division Multiplexing) optical networks has become of prime importance to network operators due to t...
Nina Skorin-Kapov, J. Chen, Lena Wosinska