Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings > Clustering Data without Prior Knowledge
Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings |
Stefan Näher; Dorothea Wagner
Springer Berlin Heidelberg
Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
Clustering Data without Prior Knowledge
Authors

Javed Aslam; Alain Leblanc; Clifford Stein

ARI Id

1664314974246_1176242

Access

Not Available Free

Pages

74-86

DOI

10.1007/3-540-44691-5_7

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-44691-5_7

Table of Contents of Book
Showing 1 to 20 of 22 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-VIII
On the Differences between “Practical” and “Applied”
Karsten Weihe
1-10
An Experimental Study of Online Scheduling Algorithms
Susanne Albers; Bianca Schröder
11-22
Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures
Kurt Mehlhorn; Guido Schäfer
23-38
Pushing the Limits in Sequential Sorting
Stefan Edelkamp; Patrick Stiegeler
39-50
Efficient Sorting Using Registers and Caches
Lars Arge; Jeff Chase; Jeffrey S. Vitter; Rajiv Wickremesinghe
51-62
Lattice Basis Reduction with Dynamic Approximation
Werner Backes; Susanne Wetzel
63-73
Clustering Data without Prior Knowledge
Javed Aslam; Alain Leblanc; Clifford Stein
74-86
Recognizing Bundles in Time Table Graphs - A Structural Approach
Annegret Liebers; Karsten Weihe
87-98
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks
I. Chatzigiannakis; S. Nikoletseas; P. Spirakis
99-110
Portable List Ranking: An Experimental Study
Isabelle Guérin Lassous; Jens Gustedt
111-122
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
Kazuo Iwama; Daisuke Kawai; Shuichi Miyazaki; Yasuo Okabe; Jun Umemoto
123-134
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
Peter Sanders; Rudolf Fleischer
135-146
Visualizing Algorithms Over the Web with the Publication-Driven Approach
Camil Demetrescu; Irene Finocchi; Giuseppe Liotta
147-158
Interchanging Tw Segments of an Array in a Hierarchical Memory System
Jesper Bojesen; Jyrki Katajainen
159-170
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Iddo Hanniel; Dan Halperin
171-182
Planar Point Location for Large Data Sets: To Seek or Not to Seek
Jan Vahrenhold; Klaus H. Hinrichs
183-194
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees
Thomas Erlebach; Klaus Jansen
195-206
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
Guido Proietti
207-217
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
Camil Demetrescu; Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni
218-229
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 22 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings