Sciweavers

1728 search results - page 101 / 346
» The Accelerated Euclidean Algorithm
Sort
View
DAGM
2011
Springer
14 years 2 months ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...
ICASSP
2009
IEEE
15 years 9 months ago
Using fourier-based shape alignment to add geometric prior to snakes
In this paper, we present a new algorithm of snakes with geometric prior. A method of shape alignment using Fourier coefficients is introduced to estimate the Euclidean transform...
Mohamed Ali Charmi, Faouzi Ghorbel, Stéphan...
SSDBM
2009
IEEE
149views Database» more  SSDBM 2009»
15 years 9 months ago
Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...
PODC
2004
ACM
15 years 8 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
DCC
2003
IEEE
15 years 8 months ago
Rate-Distortion Bound for Joint Compression and Classification
- Rate-distortion theory is applied to the problem of joint compression and classification. A Lagrangian distortion measure is used to consider both the squared Euclidean error in ...
Yanting Dong, Lawrence Carin