✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 709 || The K-D heap: An efficient multi-dimensional priority queue

✍ Scribed by Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola; Whitesides, Sue

Book ID: 120650326
Publisher: Springer Berlin Heidelberg
Year: 1993
Weight: 610 KB
Category: Article
ISBN: 354047918X
DOI: 10.1007/3-540-57155-8_257

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 709 || Global strategies for augmenting the efficiency of TSP heuristics

✍ Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola; Whitesides, Sue 📂 Article 📅 1993 🏛 Springer Berlin Heidelberg ⚖ 693 KB

[Lecture Notes in Computer Science] Adva

[Lecture Notes in Computer Science] Advances in Knowledge Discovery and Data Mining Volume 2637 || AGRID: An Efficient Algorithm for Clustering Large High-Dimensional Datasets

✍ Whang, Kyu-Young; Jeon, Jongwoo; Shim, Kyuseok; Srivastava, Jaideep 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 410 KB

The 7th Paci?c Asia Conference on Knowledge Discovery and Data Mining (PAKDD) was held from April 30 to May 2, 2003 in the Convention and Ex- bition Center (COEX), Seoul, Korea. The PAKDD conference is a major forum for academic researchers and industry practitioners in the Paci?c Asia region to sha

[Lecture Notes in Computer Science] Adva

[Lecture Notes in Computer Science] Advances in Neural Networks – ISNN 2012 Volume 7368 || A Study on Optimized Face Recognition Algorithm Realized with the Aid of Multi-dimensional Data Preprocessing Technologies and RBFNNs

✍ Wang, Jun; Yen, Gary G.; Polycarpou, Marios M. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 453 KB