Sciweavers

2661 search results - page 201 / 533
» Quantum Complexity Classes
Sort
View
105
Voted
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 3 months ago
Online Learning: Beyond Regret
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
117
Voted
COMPLEXITY
2007
94views more  COMPLEXITY 2007»
15 years 3 months ago
Emergence is coupled to scope, not level
Since its application to systems, emergence has been explained in terms of levels of observation. This approach has led to confusion, contradiction, incoherence and at times mysti...
Alex J. Ryan
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 3 months ago
Vector Precoding for Wireless MIMO Systems: A Replica Analysis
We apply the replica method to analyze vector precoding, a method to reduce transmit power in antenna array communications. The analysis applies to a very general class of channel...
Ralf R. Müller, Dongning Guo, Aris L. Moustak...
208
Voted
COMPLEXITY
2010
173views more  COMPLEXITY 2010»
14 years 10 months ago
Signal-regulated systems and networks
The paper presents the use of signal regulatory networks, a biologically-inspired model based on gene regulatory networks. Signal regulatory networks are a way of understanding a ...
Terence L. van Zyl, Elizabeth Marie Ehlers
218
Voted
ISSAC
2011
Springer
243views Mathematics» more  ISSAC 2011»
14 years 6 months ago
Practical polynomial factoring in polynomial time
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
William Hart, Mark van Hoeij, Andrew Novocin