10054 search results - page 115 / 2011 » On the Complexity of Function Learning |
92
Voted
FPCA
1989
15 years 4 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
117
click to vote
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents a new framework for accumulating beliefs in spoken dialogue systems. The technique is based on updating a Bayesian Network that represents the underlying state...
104
Voted
ICONIP
2010
14 years 11 months ago
2010
Cortical activity exhibits complex, persistent self-sustained dynamics, which is hypothesised to support the brain’s sophisticated processing capabilities. Prior studies have sho...
100
Voted
DATE
1999
IEEE
15 years 4 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
90
Voted
CORR
2007
Springer
15 years 15 days ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....