Sciweavers

995 search results - page 177 / 199
» complexity 2011
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 9 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 9 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...
153
Voted
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 9 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
Alan M. Frieze, Charalampos E. Tsourakakis
CSL
2011
Springer
14 years 9 months ago
Designing and evaluating a wizarded uncertainty-adaptive spoken dialogue tutoring system
We describe the design and evaluation of two different dynamic student uncertainty adaptations in wizarded versions of a spoken dialogue tutoring system. The two adaptive systems...
Katherine Forbes-Riley, Diane J. Litman
ECCC
2011
223views ECommerce» more  ECCC 2011»
14 years 9 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena