1220 search results - page 72 / 244 » Restricting grammatical complexity |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
AUTOMATICA
2005
13 years 7 months ago
2005
The links between identification and control are examined. The main trends in this research area are summarized, with particular focus on the design of low complexity controllers ...
ISSAC
2011
Springer
12 years 10 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
RECOMB
2009
Springer
14 years 8 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...