Sciweavers

4797 search results - page 375 / 960
» The complexity of partition tasks
Sort
View
NN
1998
Springer
15 years 6 months ago
A tennis serve and upswing learning robot based on bi-directional theory
We experimented on task-level robot learning based on bi-directional theory. The via-point representation was used for ‘learning by watching’. In our previous work, we had a r...
Hiroyuki Miyamoto, Mitsuo Kawato
TASLP
2002
84views more  TASLP 2002»
15 years 6 months ago
Maximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
Mark J. F. Gales
PUC
2010
122views more  PUC 2010»
15 years 5 months ago
What is happening now? Detection of activities of daily living from simple visual features
We propose and investigate a paradigm for activity recognition, distinguishing the ‘on-going activity’ recognition task (OGA) from that addressing ‘complete activities’ (C...
Bruno Lepri, Nadia Mana, Alessandro Cappelletti, F...
TCSV
2008
139views more  TCSV 2008»
15 years 6 months ago
A Fast MB Mode Decision Algorithm for MPEG-2 to H.264 P-Frame Transcoding
Abstract--The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter-and intra-prediction modes at the expense of higher computat...
Gerardo Fernández-Escribano, Hari Kalva, Pe...
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 10 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio