6045 search results - page 49 / 1209 » Computable Linearizations of Well-partial-orderings |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...
CASC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We describe a symbolic framework for treating linear boundary problems with a generic implementation in the Theorema system. For ordinary differential equations, the ope...
JSC
2010
13 years 6 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
An approach for fast tracking of arbitrary image features with no prior model and no offline learning stage is presented. Fast tracking is achieved using banks of linear displacem...