1092 search results - page 173 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
101
Voted
ICGI
2010
Springer
15 years 13 days ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
120
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
142
click to vote
SIGECOM
2011
ACM
14 years 4 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
147
click to vote
SIAMDM
2010
14 years 8 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
123
click to vote
SIAMSC
2010
14 years 8 months ago
2010
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...