Sciweavers

255 search results - page 16 / 51
» An Efficient Euclidean Distance Transform
Sort
View
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 4 months ago
Geometric crossovers for real-code representation
Geometric crossover is a representation-independent generalization of the class of traditional mask-based crossover for binary strings. It is based on the distance of the search s...
Yourim Yoon, Yong-Hyuk Kim, Alberto Moraglio, Byun...
JSAC
2008
115views more  JSAC 2008»
14 years 10 months ago
Optimal precoding for orthogonalized spatial multiplexing in closed-loop MIMO systems
In this paper, we propose a new precoding algorithm for orthogonalized spatial multiplexing (OSM) systems over flatfading multiple-input multiple-output (MIMO) channels. The OSM sc...
Young-Tae Kim, Heunchul Lee, Seokhwan Park, Inkyu ...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 10 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
15 years 10 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
SDM
2004
SIAM
214views Data Mining» more  SDM 2004»
14 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