Sciweavers

1728 search results - page 178 / 346
» The Accelerated Euclidean Algorithm
Sort
View
MICS
2007
90views more  MICS 2007»
15 years 2 months ago
Approximation by Conic Splines
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
Sunayana Ghosh, Sylvain Petitjean, Gert Vegter
SAC
2008
ACM
15 years 2 months ago
Trajectory retrieval with latent semantic analysis
The problem of trajectory similarity has been recently attracted research interest considerably, due to its importance in diverse fields. In this work, we study trajectory similar...
Apostolos N. Papadopoulos
100
Voted
FOCM
2010
82views more  FOCM 2010»
15 years 1 months ago
Stability and Instance Optimality for Gaussian Measurements in Compressed Sensing
In compressed sensing we seek to gain information about vector x ∈ RN from d << N nonadaptive linear measurements. Candes, Donoho, Tao et. al. ( see e.g. [2, 4, 8]) propos...
P. Wojtaszczyk
PR
2010
144views more  PR 2010»
15 years 1 months ago
Classifying transformation-variant attributed point patterns
This paper presents a classification approach, where a sample is represented by a set of feature vectors called an attributed point pattern. Some attributes of a point are transf...
K. E. Dungan, L. C. Potter
ICIP
2009
IEEE
16 years 3 months ago
Efficient Distance Estimation For Fitting Implicit Quadric Surfaces
This paper presents a novel approach for estimating the shortest Euclidean distance from a given point to the corresponding implicit quadric fitting surface. It first estimates t...
Angel D. Sappa, Mohammad Rouhani