845 search results - page 16 / 169 » Complexity Dimensions and Learnability |
COLT
1991
Springer
13 years 11 months ago
1991
Springer
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
APCCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper investigates both transmultiplexer (TMUX) and analysis-synthesis filter banks where the two sides of the filter bank system are of different sizes. Such configura...
STACS
2005
Springer
14 years 25 days ago
2005
Springer
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
ALT
1995
Springer
13 years 11 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...