| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Andrew Rau-Chaplin Michael Lawrence , Andrew Rau-Chaplin: The OLAP-Enabled Grid: Model and Query Processing Algorithms. HPCS 2006 : 4 Ying Chen , Andrew Rau-Chaplin, Frank K. H. A. Dehne , Todd Eavis , D. Green , E. Sithirasenan : cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes. ICDE 2006 : 164 Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: Parallel querying of ROLAP cubes in the presence of hierarchies. DOLAP 2005 : 89-96 Albert Chan , Chunmei Gao , Andrew Rau-Chaplin: A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering. HPCC 2005 : 856-865 Ying Chen , Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: PnP: Parallel And External Memory Iceberg Cubes. ICDE 2005 : 576-577 Philip T. Cox , Simon Gauvin , Andrew Rau-Chaplin: Adding parallelism to visual data flow programs. SOFTVIS 2005 : 135-144 Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: Top-Down Computation of Partial ROLAP Data Cubes. HICSS 2004 Ying Chen , Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: Building Large ROLAP Data Cubes in Parallel. IDEAS 2004 : 367-377 Ying Chen , Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors. Distributed and Parallel Databases 15 (3): 219-236 (2004) James Cheetham , Frank K. H. A. Dehne , Andrew Rau-Chaplin, Ulrike Stege , Peter J. Taillon : A Parallel FPT Application For Clusters. CCGRID 2003 : 70-77 Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: Parallel Multi-Dimensional ROLAP Indexing. CCGRID 2003 : 86- James Cheetham , Frank K. H. A. Dehne , Sylvain Pitre , Andrew Rau-Chaplin, Peter J. Taillon : Parallel CLUSTAL W for PC Clusters. ICCSA (2) 2003 : 300-309 Ying Chen , Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors. IPDPS 2003 : 70 James Cheetham , Frank K. H. A. Dehne , Andrew Rau-Chaplin, Ulrike Stege , Peter J. Taillon : Solving large FPT problems on coarse-grained parallel machines. J. Comput. Syst. Sci. 67 (4): 691-706 (2003) Afonso Ferreira , Isabelle Guérin Lassous , K. Marcus , Andrew Rau-Chaplin: Parallel computation on interval graphs: algorithms and experiments. Concurrency and Computation: Practice and Experience 14 (11): 885-910 (2002) Frank K. H. A. Dehne , Todd Eavis , Susanne E. Hambrusch , Andrew Rau-Chaplin: Parallelizing the Data Cube. Distributed and Parallel Databases 11 (2): 181-201 (2002) Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: A Cluster Architecture for Parallel Data Warehousing. CCGRID 2001 : 161-168 Frank K. H. A. Dehne , Todd Eavis , Susanne E. Hambrusch , Andrew Rau-Chaplin: Parallelizing the Data Cube. ICDT 2001 : 129-143 Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining. International Conference on Computational Science (2) 2001 : 589-598 Frank K. H. A. Dehne , Todd Eavis , Andrew Rau-Chaplin: Computing Partial Data Cubes for Parallel Data Warehousing Applications. PVM/MPI 2001 : 319-326 Mohamadou Diallo , Afonso Ferreira , Andrew Rau-Chaplin: A Note on Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2D Voronoï Diagram. Parallel Processing Letters 11 (2/3): 327-340 (2001) Michael G. Lamoureux , Andrew Rau-Chaplin: Parallel Algorithms for Grounded Range Search and Applications. Euro-Par 1999 : 525-532 Afonso Ferreira , Claire Kenyon , Andrew Rau-Chaplin, Stéphane Ubéda : d -Dimensional Range Search on Multicomputers. Algorithmica 24 (3-4): 195-208 (1999) Mohamadou Diallo , Afonso Ferreira , Andrew Rau-Chaplin, Stéphane Ubéda : Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers. J. Parallel Distrib. Comput. 56 (1): 47-70 (1999) Albert Chan , Frank K. H. A. Dehne , Andrew Rau-Chaplin: Coarse-Grained Parallel Geometric Search. J. Parallel Distrib. Comput. 57 (2): 224-235 (1999) Laurence Boxer , Russ Miller , Andrew Rau-Chaplin: Scalable Parallel Algorithms for Geometric Pattern Recognition. J. Parallel Distrib. Comput. 58 (3): 466-486 (1999) Afonso Ferreira , Isabelle Guérin Lassous , K. Marcus , Andrew Rau-Chaplin: Parallel Computation on Interval Graphs Using PC CLusters: Algorithms and Experiments. Euro-Par 1998 : 875-886 Vassil N. Alexandrov , Frank K. H. A. Dehne , Andrew Rau-Chaplin, Keith Taft : Coarse Grained Parallel Monte Carlo Algorithms for Solving SLAE Using PVM. PVM/MPI 1998 : 323-330 Mohamadou Diallo , Afonso Ferreira , Andrew Rau-Chaplin: Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram. STACS 1998 : 399-409 Laurence Boxer , Russ Miller , Andrew Rau-Chaplin: Scaleable Parallel Algorithms for Lower Envelopes with Applications. J. Parallel Distrib. Comput. 53 (2): 91-118 (1998) Frank K. H. A. Dehne , Andrew Rau-Chaplin, Jörg-Rüdiger Sack , Roberto Tamassia : Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings Springer 1997 Albert Chan , Frank K. H. A. Dehne , Andrew Rau-Chaplin: Coarse Grained Parallel Next Element Search. IPPS 1997 : 320- Afonso Ferreira , Claire Kenyon , Andrew Rau-Chaplin, Stéphane Ubéda : d-Dimensional Range Search on Multicomputers. IPPS 1997 : 616-620 Andrew Rau-Chaplin, Trevor J. Smedley : A Graphical Language for Generating Architectural Forms. VL 1997 : 264-271 Frank K. H. A. Dehne , Andreas Fabri , Andrew Rau-Chaplin: Scalable parallel computational geometry for coarse grained multicomputers. Int. J. Comput. Geometry Appl. 6 (3): 379-400 (1996) Mikhail J. Atallah , Frank K. H. A. Dehne , Russ Miller , Andrew Rau-Chaplin, Jyh-Jong Tsay : Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers. J. Parallel Distrib. Comput. 20 (1): 1-13 (1994) Frank K. H. A. Dehne , Andreas Fabri , Mostafa Nassar , Andrew Rau-Chaplin, Rada Valiveti : Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor. J. Parallel Distrib. Comput. 23 (2): 256-262 (1994) Frank K. H. A. Dehne , Afonso Ferreira , Andrew Rau-Chaplin: A Massively Parallel Knowledge-Base Server Using a Hypercube Multiprocessor. Parallel Computing 20 (9): 1369-1382 (1994) Frank K. H. A. Dehne , Andreas Fabri , Andrew Rau-Chaplin: Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. Symposium on Computational Geometry 1993 : 298-307 Laurence Boxer , Chun-Shi Chang , Russ Miller , Andrew Rau-Chaplin: Polygonal approximation by boundary reduction. Pattern Recognition Letters 14 (2): 111-119 (1993) Frank K. H. A. Dehne , Afonso Ferreira , Andrew Rau-Chaplin: Parallel Fractional Cascading on Hypercube Multiprocessors. Comput. Geom. 2 : 141-167 (1992) Frank K. H. A. Dehne , Andrew Rau-Chaplin: Parallel algorithms for color image quantization on hypercubes and meshes. Algorithms and Parallel VLSI Architectures 1991 : 91-96 Frank K. H. A. Dehne , Afonso Ferreira , Andrew Rau-Chaplin: Efficient Parallel Construction and Manipulation of Quadtrees. ICPP (3) 1991 : 255-262 Mikhail J. Atallah , Frank K. H. A. Dehne , Russ Miller , Andrew Rau-Chaplin, Jyh-Jong Tsay : Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version). SPAA 1991 : 204-214 Frank K. H. A. Dehne , Andrew Rau-Chaplin: Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. J. Parallel Distrib. Comput. 8 (4): 367-375 (1990) Frank K. H. A. Dehne , Afonso Ferreira , Andrew Rau-Chaplin: A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors. Parallel Computing 15 (1-3): 201-209 (1990) Frank K. H. A. Dehne , Andrew Rau-Chaplin: Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. WG 1989 : 316-329 1 [ 20 ] 2 [ 4 ] [ 12 ] 3 [ 8 ] [ 18 ] [ 22 ] 4 [ 16 ] [ 23 ] [ 44 ] 5 [ 8 ] 6 [ 34 ] [ 36 ] [ 38 ] 7 [ 35 ] [ 39 ] [ 40 ] [ 43 ] [ 46 ] 8 [ 42 ] 9 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 16 ] [ 17 ] [ 20 ] [ 23 ] [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 34 ] [ 35 ] [ 36 ] [ 37 ] [ 38 ] [ 39 ] [ 40 ] [ 41 ] [ 43 ] [ 45 ] [ 46 ] 10 [ 19 ] [ 24 ] [ 27 ] 11 [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 35 ] [ 37 ] [ 39 ] [ 40 ] [ 41 ] [ 43 ] [ 45 ] [ 46 ] 12 [ 9 ] [ 11 ] [ 13 ] 13 [ 2 ] [ 5 ] [ 7 ] [ 10 ] [ 15 ] [ 19 ] [ 21 ] [ 24 ] [ 25 ] [ 27 ] [ 33 ] 14 [ 44 ] 15 [ 42 ] 16 [ 46 ] 17 [ 30 ] [ 32 ] 18 [ 15 ] [ 25 ] 19 [ 26 ] 20 [ 21 ] [ 33 ] 21 [ 47 ] 22 [ 21 ] [ 33 ] 23 [ 4 ] [ 8 ] [ 12 ] [ 18 ] [ 22 ] 24 [ 11 ] 25 [ 36 ] 26 [ 17 ] 27 [ 46 ] 28 [ 14 ] 29 [ 34 ] [ 38 ] 30 [ 20 ] 31 [ 34 ] [ 36 ] [ 38 ] 32 [ 17 ] 33 [ 4 ] [ 12 ] 34 [ 15 ] [ 24 ] [ 25 ] 35 [ 11 ]  ©2006 Association for Computing Machinery |
