1403 search results - page 39 / 281 » Set cover algorithms for very large datasets |
IDEAS
2006
IEEE
14 years 2 months ago
2006
IEEE
Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteri...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
In this paper, we propose a component-based discriminative approach for face alignment without requiring initialization1 . Unlike many approaches which locally optimize in a small ...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— We introduce a method for fast and accurate registration of multiple horizontal laser scans obtained by a mobile robot. The method is based on novel representation of t...
ICPP
2000
IEEE
14 years 27 days ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
ICCV
2009
IEEE
13 years 6 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...