| Alternate document: Details An Efficient Thermal Infrared Radiation Parameterization For Use In General Circulation Models (94) Ming-Dah Chou Max J. Suarez |
Peter Su  Home/Search
Context Related
| duke.edu/pub/dist/techre...199422.ps.Z berkeley.edu/~jrs/mesh...SuThesis.ps.gz Cached: PS.gz PS PDF DjVu Image Update Help From: duke.edu (more) Homepages: P.Su HPSearch (Update Links) |
Rate this article:      (best)Comment on this article |
Abstract: OF THE THESIS This dissertation develops and studies fast algorithms for solving closest point problems. Algorithms for such problems have applications in many areas including statistical classification, crystallography, data compression, and finite element analysis. In addition to a comprehensive empirical study of known sequential methods, I introduce new parallel algorithms for these problems that are both efficient and practical. I present a simple and flexible programmingmodel for... (Update)
Context of citations to this paper: More
...scalability in terms of both parallel speedup and achievable problem size. The use of decomposition techniques such as bucketing [28, 11, 37, 35], or striping [14] can also reduce communication, but relies on the input dataset having a uniform spatial distribution of points...
...algorithms based upon divide andconquer and sweepline techniques, which will be discussed here only briefly. Refer to Su and Drysdale [68, 67] for an overview of these and other two dimensional Delaunay triangulation algorithms. Incremental insertion algorithms operate by...
Cited by: More
Design and Implementation of a Practical Parallel.. - Blelloch, Hardwick, .. (1999) (Correct)
A Comparison of Sequential Delaunay Triangulation Algorithms - Su, Drysdale (1996) (Correct)
A Delaunay Based Numerical Method for Three.. - Miller, Talmor.. (1995) (Correct)
Active bibliography (related documents): More All
1.5: Developing a Practical Projection-Based Parallel Delaunay.. - Blelloch, Miller, Talmor (1996) (Correct)
0.8: Voronoi Diagrams and Delaunay Triangulations - Fortune (1992) (Correct)
0.6: Analysis of a class of k-dimensional merge procedures, with.. - Lemaire, Moreau (1997) (Correct)
Similar documents based on text: More All
0.2: Computer Science - Computer Science Computer (Correct)
0.2: A Simple Linear Time Greedy Triangulation Algorithm for.. - Drysdale, Rote, al. (1995) (Correct)
0.2: Centralized and Distributed Algorithms for Network Scheduling - Fizzano (Correct)
Related documents from co-citation: More All
5: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
5: A comparison of sequential delaunay triangulation algorithms - Su, Drysdale - 1995
5: A data-parallel algorithm for three-dimensional Delaunay triangulation and its i.. (context) - Teng, Sullivan et al. - 1993
BibTeX entry: (Update)
Peter Su. Efficient parallel algorithms for closest point problems. PhD thesis, Dartmouth College, 1994. PCS-TR94-238. http://citeseer.nj.nec.com/su94efficient.html More
@techreport{ susuefficient,
author = "Peter Su.",
title = "Efficient Parallel Algorithms for Closest Point Problems",
publisher = "Department of Computer Science, Duke University",
url = "citeseer.nj.nec.com/su94efficient.html" }
Citations (may not include all citations):2998 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1114 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
1075 Concurrency Control and Recovery in Database Systems (context) - Bernstein, Hadzilacos et al. - 1987
599 A bridging model for parallel computation (context) - Valiant - 1990
463 Logp: Towards a realistic model of parallel computation - Culler, Karp et al. - 1992
372 Solving Problems on Concurrent Processors (context) - Fox, Johnson et al. - 1988
315 Basic linear algebra subprograms for fortran usage (context) - Lawson, Hanson et al. - 1979
272 Applications of random sampling in computational geometry - Clarkson, Shor - 1989
254 Parallel algorithms for shared memory machines (context) - Karp, Ramachandran - 1990
239 Algorithms for scalable synchronization on shared memory mul.. (context) - Mellor-Crummey, Scott - 1991
223 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
217 A measure of asymptotic efficiency for tests of a hypothesis.. (context) - Chernoff - 1952
190 Data parallel algorithms (context) - Steele, Hillis - 1986
188 Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
145 Nesl: A nested data-parallel language - Blelloch - 1993
142 A comparison of sorting algorithms for the connection machin.. - Blelloch, Leiserson et al. - 1991
133 Guided self-scheduling: A practical scheduling scheme for pa.. (context) - Polychronopoulos, Kuck - 1987
124 A sweepline algorithm for voronoi diagrams (context) - Fortune - 1987
108 Spatial Tessellations: Concepts and Applications of Voronoi .. (context) - Okabe, Boots et al. - 1992
100 The dash prototype: Implementation and performance (context) - Lenoski, Laudon et al. - 1992
88 Compiler support for machineindependent parallel programming.. - Hiranandani, Kennedy et al. - 1991
86 Supporting shared data structures on distributed memory arch.. (context) - Koelbel, Mehrotra et al. - 1990
85 Randomized incremental construction of delaunay and voronoi .. (context) - Guibas, Knuth et al. - 1992
85 The implementation of a coherent memory abstraction on a num.. (context) - Cox, Fowler - 1989
85 Algorithms for parallel memory I: Two-level memories - Vitter, Shriver - 1992
82 Multi-dimensional divide-and-conquer (context) - Bentley - 1980
82 Information Processing Letters (context) - Hagerup, Rub et al. - 1989
81 Optimizing Supercompilers for Supercomputers (context) - Wolfe - 1989
78 The apram: Incorporating asynchrony into the pram model (context) - Cole, Zajicek - 1989
76 Closest-point problems (context) - Shamos, Hoey - 1975
75 The wisconsin multicube: A new large-scale cachecoherent mul.. (context) - Goodman, Woest - 1988
69 A linear time algorithm for computing the voronoi diagram of.. (context) - Aggarwal, Guibas et al. - 1989
69 Communication complexity of prams (context) - Aggarwal, Chandra et al. - 1990
66 A complexity theory of efficient parallel algorithms (context) - Kruskal, Rudolph et al. - 1990
66 Verifiable implementations of geometric algorithms using fin.. (context) - Milenkovic - 1988
55 Optimal expected time algorithms for closest point problems (context) - Bentley, Weide et al. - 1980
55 Parallel computational geometry (context) - Aggarwal, Chazelle et al. - 1988
53 A geometric consistency theorem for a symbolic pertubation s.. (context) - Yap - 1990
50 The ultimate planar convex hull algorithm (context) - Kirkpatrick, Seidel - 1982
50 Transactional memory: Architectural support for lock free da.. - Herlihy, Moss - 1992
49 Two algorithms for constructing a delaunay triangulation (context) - Lee, Schachter - 1980
45 Cascading divide and conquer: A technique for designing para.. (context) - Attallah, Cole et al. - 1989
44 Evaluating the performance of four snooping cache-coherency .. (context) - Eggers, Katz - 1989
42 Four results on randomized incremental construction - Clarkson, Mehlhorn et al. - 1992
42 Virtual Memory for Data-Parallel Computing (context) - Cormen - 1992
34 Higher-dimensional voronoi diagrams in linear expected time (context) - Dwyer - 1991
34 Hiding shared memory reference latency on the galactica-net .. (context) - Wilson, LaRowe - 1992
33 Implementations of randomized sorting on large parallel mach.. - Prins, Hightower et al. - 1992
32 Integral Geometry and Geometric Probability (context) - Santalo - 1976
32 Stable maintenance of point-set triangulations in two dimens.. (context) - Fortune - 1989
31 Computing dirichlet tessellations in the plane (context) - Green, Sibson - 1977
29 Communication efficient parallel algorithms for distributed .. - Leiserson, Maggs - 1988
24 Radix sort for vector multiprocessors - Zagha, Blelloch - 1991
21 A faster divide-and-conquer algorithm for constructing delau.. (context) - Dwyer - 1987
20 Writing Efficient Programs (context) - Bentley - 1982
20 Ultra-fast expected time parallel algorithms - MacKenzie, Stout - 1990
19 Fully dynamic delaunay triangulation in logarithmic expected.. - Devillers, Meider et al. - 1990
16 time algorithm for the threedimensional convex hull problem (context) - Edelsbrunner, Shi et al. - 1991
15 Beyond core: Making parallel computer I/O practical - Womble, Greenberg et al. - 1993
14 Scan primitives for vector computers - Chatterjee, Blelloch et al. - 1990
13 Compiling Data-parallel Programs for Efficient Execution on .. (context) - Chatterjee - 1991
12 A new algorithm for three dimensionalvoronoi tessellation (context) - Tanemura, Ogawa et al. - 1983
12 The expected extremes in a delaunay triangulation - Bern, Eppstein et al. - 1991
11 Polling: A new randomized sampling technique for computation.. (context) - Reif, Sen - 1989
11 Parallel geometric algorithms on a mesh connected computer (context) - Jeong, Lee - 1990
11 programs for a hypercube multicomputer (context) - Quinn, Hatcher et al. - 1988
10 Delaunay triangulation and the convex hull of n points in ex.. (context) - Maus - 1984
10 Experimental Analysis of Algorithms (context) - McGeoch - 1986
9 Merging free trees in parallel for efficient voronoi diagram.. (context) - Cole, Goodrich et al. - 1990
8 Logarithmic time cost optimal parallel sorting is not yet fa.. - Natvig - 1990
7 A data-parallel algorithm for threedimensional delaunay tria.. (context) - Teng, Sullivan et al. - 1993
7 Size and access inference for data parallel programs (context) - Chatterjee, Blelloch et al. - 1991
6 Applied computational geometry: Towards robust solutions of .. (context) - Dobkin, Silver - 1990
5 Tools for experiments on algorithms (context) - Bentley - 1991
5 Constructing delaunay triangulations by merging buckets in q.. (context) - Katajainen, Koppinen - 1987
5 Computational geometry with imprecise data and arithmetic (context) - Barber - 1993
5 Parallel implementation of an algorithm for delaunay triangu.. (context) - Merriam - 1992
5 Numerical stability of algorithms for delaunay triangulation.. (context) - Fortune - 1992
5 Improvements of the incremental method for the voronoi diagr.. (context) - Ohya, Iri et al. - 1984
4 Constructing the voronoi diagram on a mesh connected compute.. (context) - Lu - 1986
4 An optimal expected-time parallel algorithm for voronoi diag.. (context) - Levcopoulos, Katajainen et al. - 1988
3 An efficient expected time parallel algorithm for voronoi co.. (context) - Venmuri, Varadarajan et al. - 1992
3 The directory-based cachecoherency protocol for the dash mul.. (context) - Lenoski, Laudon et al. - 1990
3 Greed sort: An optimal external sorting algorithm for multip.. (context) - Nodine, Vitter - 1991
3 A practical hierachical model of parallel computation: The m.. (context) - Heywood, Ranka - 1991
2 Parallel Algorithms for Computational Geometry (context) - Chow - 1980
2 ACM Symposium On Theory Of Computing (context) - Alpern, Carter et al. - 1990
2 Average-case Analysis of Algorithms for Convex Hulls and Vor.. (context) - Dwyer - 1988
2 Voronoi diagrams-a survey of a fundemantal geometric data st.. (context) - Aurenhammer - 1991
2 th Annual ACM Symposium on Computational Geometry (context) - Bentley, for et al. - 1990
2 Computational geometry on a hypercube (context) - Stojmenovic - 1986
2 Randomized incremental construction of delaunay diagrams: Th.. (context) - Sharir, Yaniv - 1991
1 Compilig parallel programs by optimizing performance (context) - Chen, Choo et al. - 1988
1 Prototyping parallel and distributed algorithms in proteus (context) - Mills, Nyland et al. - 1991
1 Efficient syncrhonization primitives for large-scale cache-c.. (context) - Goodman, Vernon et al. - 1989
1 Optimal parallel randomized algorithms for 3-d convex hulls .. - Reif, Sen - 1992
1 Computing digitized voronoi diagrams on a systolic screen an.. (context) - Dehne - 1989
1 The Cyberiad: Fables for the Cybernetic Age (context) - Lem - 1985
1 The dino parallel progamming language (context) - Rosing, Schnabel et al. - 1990
1 Statistical Methods for the Analysis of Algorithms (context) - Weide - 1978
1 Algorithms for Closest Point Problems (context) - Clarkson - 1984
1 Scans as primitive parallel operators (context) - Blelloch - 1989
1 Limitless directories: A scalable cache coherence scheme (context) - Aggarwal, Jubiatowicz et al. - 1991
1 Efficient comvexity and domination algorithms for fine- and .. (context) - Cohen, Miller et al. - 1992
1 ACM-SIAM Symposium on Discrete Algorithms (context) - Bentley, travel - 1989
1 Annual ACM Symposium on Parallel Algorithms and Architecture.. (context) - Gibbons, practical et al. - 1989
1 Annual ACM Symposium on Parallel Algorithms and Architecture.. (context) - Aggarwal, Chandra et al. - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.duke.edu.html): More
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994) (Correct)
A Notation for Lambda Terms II: Refinements and Applications - Nadathur (1994) (Correct)
I/O-Efficient Scientific Computation Using TPIE - Darren Erik (1995) (Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute