Efficient algorithms for computing distances between one-dimensional point sets
Let S and T denote sets of points on the line with the total number of points equal to n. In this thesis the focus is on computing distance measures between S and T as defined by different types of assignments . An assignment is a function, F, which pairs elements of the two sets together. In pa...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
McGill University
2005
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=84019 |