Sciweavers

Share
CVPR
2009
IEEE
9 years 8 months ago
Learning IMED via shift-invariant transformation
The IMage Euclidean Distance (IMED) is a class of image metrics, in which the spatial relationship between pixels is taken into consideration. It was shown that calculating the IM...
Bing Sun, Jufu Feng, Liwei Wang
WOA
2010
9 years 8 months ago
A Self-Organising System for Resource Finding in Large-Scale Computational Grids
This paper presents a novel approach for resource finding and job allocation in a computational Grid. The proposed system is called HYGRA, for HYperspace-based Grid Resource Alloca...
Fabrizio Messina, Giuseppe Pappalardo, Corrado San...
VLDB
2002
ACM
126views Database» more  VLDB 2002»
9 years 10 months ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh
TIT
1998
100views more  TIT 1998»
9 years 10 months ago
Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups
—A length n group code over a group G is a subgroup of Gn under component-wise group operation. Group codes over dihedral groups DM, with 2M elements, that are two-level construc...
Jyoti Bali, B. Sundar Rajan
IPL
2007
104views more  IPL 2007»
9 years 10 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
PAMI
2000
99views more  PAMI 2000»
9 years 10 months ago
Biometric Identification through Hand Geometry Measurements
Raul Sánchez-Reillo, Carmen Sanchez-Avila, ...
COMGEO
2007
ACM
9 years 10 months ago
Geometric spanners with applications in wireless networks
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
9 years 10 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
SDM
2004
SIAM
214views Data Mining» more  SDM 2004»
9 years 11 months ago
Making Time-Series Classification More Accurate Using Learned Constraints
It has long been known that Dynamic Time Warping (DTW) is superior to Euclidean distance for classification and clustering of time series. However, until lately, most research has...
Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh
COMPSAC
2005
IEEE
10 years 10 days 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
books