Sciweavers

116 search results - page 9 / 24
» Testing Euclidean Spanners
Sort
View
IM
2008
13 years 8 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
CEC
2007
IEEE
14 years 18 days ago
Self-Adaptive Niching CMA-ES with Mahalanobis Metric
Existing niching techniques commonly use the Euclidean distance metric in the decision space for the classification of feasible solutions to the niches under formation. This approa...
Ofer M. Shir, Michael Emmerich, Thomas Bäck
ESANN
2004
13 years 10 months ago
Speaker verification by means of ANNs
In text-dependent speaker verification the speech signals have to be time-aligned. For that purpose dynamic time warping (DTW) can be used which performs the alignment by minimizi...
Urs Niesen, Beat Pfister
COMPSAC
2005
IEEE
13 years 10 months ago
Similarity Measurement Between Images
Experimental results of applying two similarity measurements, Euclidean distance and chord distance, to test a set of six Brodatz’s textures are reported. Experiments show that ...
Chaur-Chin Chen, Hsueh-Ting Chu
ICASSP
2009
IEEE
14 years 3 months ago
Rate-constrained distributed distance testing and its applications
We investigate a practical approach to solving one instantiation of a distributed hypothesis testing problem under severe rate constraints that shows up in a wide variety of appli...
Chuohao Yeo, Parvez Ahammad, Hao Zhang, Kannan Ram...