447 search results - page 23 / 90 » Generalization from Observed to Unobserved Features by Clust... |
106
click to vote
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we present a novel approach using a 4D (x,y,z,t) action feature model (4D-AFM) for recognizing actions from arbitrary views. The 4D-AFM elegantly encodes shape and m...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
GPCE
2009
Springer
15 years 2 months ago
2009
Springer
Programs can be composed from features. We want to verify automatically that all legal combinations of features can be composed safely without errors. Prior work on this problem a...
ASPLOS
2004
ACM
15 years 3 months ago
2004
ACM
Maintenance is the dominant source of downtime at high availability sites. Unfortunately, the dominant mechanism for reducing this downtime, cluster rolling upgrade, has two short...