514 search results - page 12 / 103 » On the Structure of Valiant's Complexity Classes |
TIT
2010
13 years 3 months ago
2010
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
COLT
2006
Springer
14 years 9 days ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
JMLR
2006
13 years 8 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
CCIA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...