3250 search results - page 48 / 650 » Parameterized Learning Complexity |
VIS
2006
IEEE
14 years 11 months ago
2006
IEEE
Current practice in particle visualization renders particle position data directly onto the screen as points or glyphs. Using a camera placed at a fixed position, particle motions...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
ALT
2006
Springer
14 years 6 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
ICANN
2007
Springer
14 years 1 months ago
2007
Springer
We present an artificial neural network used to learn online complex temporal sequences of gestures to a robot. The system is based on a simple temporal sequences learning architec...