2272 search results - page 30 / 455 » Capture Complexity by Partition |
KES
1998
Springer
15 years 1 months ago
1998
Springer
Robotic controllers take advantage from neural network learning capabilities as long as the dimensionality of the problem is kept moderate. This paper explores the possibilities of...
MCS
2000
Springer
15 years 1 months ago
2000
Springer
Various methods exist for reducing correlation between classifiers in a multiple classifier framework. The expectation is that the composite classifier will exhibit improved perfor...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our approach...
75
Voted
IJCV
2008
14 years 9 months ago
2008
Abstract We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our ...
DAM
2006
14 years 9 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...