817 search results - page 7 / 164 » Robust Euclidean embedding |
ICDCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. However, most coordinate sy...
IJCV
2007
13 years 7 months ago
2007
Abstract. Inspired by the early visual system of many mammalians we consider the construction of-and reconstruction from- an orientation score Uf : R2 ×S1 → C as a local orienta...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Most existing appearance models for visual tracking usually construct a pixel-based representation of object appearance so that they are incapable of fully capturing both global an...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...