1552 search results - page 187 / 311 » On the Complexity of Constant Propagation |
147
click to vote
ML
1998
ACM
15 years 6 months ago
1998
ACM
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
155
click to vote
MVA
2002
15 years 6 months ago
2002
As digital cameras have been used widely, a technology to extract features of character string areas from scenery (nature) image is required. However, it is very difficult to extr...
236
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Recently SVMs using spatial pyramid matching (SPM)
kernel have been highly successful in image classification.
Despite its popularity, these nonlinear SVMs have a complexity
O(n...
189
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
A method for detecting and segmenting periodic motion is presented. We exploit periodicity as a cue and detect periodic motion in complex scenes where common methods for motion se...
203
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...