Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data

Details Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data

2010-09-11

arxiv.org/abs/1009.2160v1

Proceedings of the IEEE International Conference on Automation, Quality and Testing, Robotics (THETA 17) (AQTR) - Student Foru

Computer Science

Data Structures and Algorithms

ISBN: 978-973-662-574-9

Scientific paper

In this paper we present novel algorithms for several multidimensional data processing problems. We consider problems related to the computation of restricted clusters and of the diameter of a set of points using a new distance function. We also consider two string (1D data) processing problems, regarding an optimal encoding method and the computation of the number of occurrences of a substring within a string generated by a grammar. The algorithms have been thoroughly analyzed from a theoretical point of view and some of them have also been evaluated experimentally.

Affiliated with

Also associated with

No associations

Rating

Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering, Encoding and Diameter Computation Algorithms for Multidimensional Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-562781