7106 search results - page 324 / 1422 » Restricted Complexity, General Complexity |
124
click to vote
IJAC
2006
15 years 4 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
109
click to vote
TSP
2008
15 years 4 months ago
2008
Over the past several years, there has been a renewed interest in complex orthogonal designs for their application in space-time block coding. Motivated by the success of this app...
167
click to vote
IJON
2002
15 years 4 months ago
2002
The Self-Organizing Map, SOM, is a widely used tool in exploratory data analysis. A major drawback of the SOM has been the lack of a theoretically justified criterion for model se...
161
click to vote
JMLR
2010
14 years 11 months ago
2010
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...
157
Voted
JMLR
2010
14 years 11 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...