10054 search results - page 342 / 2011 » On the Complexity of Function Learning |
138
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
165
click to vote
SSDBM
2009
IEEE
15 years 10 months ago
2009
IEEE
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
136
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
124
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
The desirable asymptotic optimality properties of the maximum likelihood (ML) estimator make it an attractive solution for performing independent component analysis (ICA) as well....
138
click to vote
CODES
2007
IEEE
15 years 10 months ago
2007
IEEE
The design and analysis of today’s complex real-time systems requires advanced methods. Due to ever growing functionality, hardware complexity and component interaction, applyin...