2008 | ||
---|---|---|
59 | EE | Oliver Baltzer, Frank K. H. A. Dehne, Susanne E. Hambrusch, Andrew Rau-Chaplin: OLAP for Trajectories. DEXA 2008: 340-347 |
58 | EE | Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: PnP: sequential, external memory, and parallel iceberg cube computation. Distributed and Parallel Databases 23(2): 99-126 (2008) |
57 | EE | Chris H. Hamilton, Andrew Rau-Chaplin: Compact Hilbert indices: Space-filling curves for domains with unequal side lengths. Inf. Process. Lett. 105(5): 155-163 (2008) |
2007 | ||
56 | EE | Chris H. Hamilton, Andrew Rau-Chaplin: Compact Hilbert Indices for Multi-Dimensional Data. CISIS 2007: 139-146 |
55 | EE | Jean-Paul Deveaux, Andrew Rau-Chaplin, Norbert Zeh: Adaptive Tuple Differential Coding. DEXA 2007: 109-119 |
54 | EE | Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: Efficient computation of view subsets. DOLAP 2007: 65-72 |
53 | EE | Adan Cosgaya-Lozano, Andrew Rau-Chaplin, Norbert Zeh: Parallel Computation of Skyline Queries. HPCS 2007: 12 |
52 | EE | Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau-Chaplin: Implementing OLAP Query Fragment Aggregation and Recombination for the OLAP Enabled Grid. IPDPS 2007: 1-8 |
2006 | ||
51 | EE | Michael Lawrence, Andrew Rau-Chaplin: Dynamic View Selection for OLAP. DaWaK 2006: 33-44 |
50 | EE | Michael Lawrence, Andrew Rau-Chaplin: The OLAP-Enabled Grid: Model and Query Processing Algorithms. HPCS 2006: 4 |
49 | EE | 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 |
48 | EE | Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: The cgmCUBE project: Optimizing parallel data cube generation for ROLAP. Distributed and Parallel Databases 19(1): 29-62 (2006) |
2005 | ||
47 | EE | Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: Parallel querying of ROLAP cubes in the presence of hierarchies. DOLAP 2005: 89-96 |
46 | EE | 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 |
45 | EE | Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: PnP: Parallel And External Memory Iceberg Cubes. ICDE 2005: 576-577 |
44 | Christian Blouin, Davin Butt, Glenn Hickey, Andrew Rau-Chaplin: Fast Parallel Maximum Likelihood-Based Protein Phylogeny. ISCA PDCS 2005: 281-287 | |
43 | EE | Philip T. Cox, Simon Gauvin, Andrew Rau-Chaplin: Adding parallelism to visual data flow programs. SOFTVIS 2005: 135-144 |
2004 | ||
42 | EE | Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: Top-Down Computation of Partial ROLAP Data Cubes. HICSS 2004 |
41 | EE | Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: Building Large ROLAP Data Cubes in Parallel. IDEAS 2004: 367-377 |
40 | EE | 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) |
2003 | ||
39 | EE | 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 |
38 | EE | Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: Parallel Multi-Dimensional ROLAP Indexing. CCGRID 2003: 86- |
37 | EE | 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 |
36 | EE | Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors. IPDPS 2003: 70 |
35 | EE | 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) |
2002 | ||
34 | 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) | |
33 | 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) | |
2001 | ||
32 | EE | Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: A Cluster Architecture for Parallel Data Warehousing. CCGRID 2001: 161-168 |
31 | EE | Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin: Parallelizing the Data Cube. ICDT 2001: 129-143 |
30 | EE | 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 |
29 | EE | Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin: Computing Partial Data Cubes for Parallel Data Warehousing Applications. PVM/MPI 2001: 319-326 |
28 | 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) | |
1999 | ||
27 | EE | Michael G. Lamoureux, Andrew Rau-Chaplin: Parallel Algorithms for Grounded Range Search and Applications. Euro-Par 1999: 525-532 |
26 | EE | Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda: d-Dimensional Range Search on Multicomputers. Algorithmica 24(3-4): 195-208 (1999) |
25 | 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) | |
24 | Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin: Coarse-Grained Parallel Geometric Search. J. Parallel Distrib. Comput. 57(2): 224-235 (1999) | |
23 | Laurence Boxer, Russ Miller, Andrew Rau-Chaplin: Scalable Parallel Algorithms for Geometric Pattern Recognition. J. Parallel Distrib. Comput. 58(3): 466-486 (1999) | |
1998 | ||
22 | EE | 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 |
21 | EE | 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 |
20 | Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin: Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram. STACS 1998: 399-409 | |
19 | Laurence Boxer, Russ Miller, Andrew Rau-Chaplin: Scaleable Parallel Algorithms for Lower Envelopes with Applications. J. Parallel Distrib. Comput. 53(2): 91-118 (1998) | |
1997 | ||
18 | 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 | |
17 | EE | Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin: Coarse Grained Parallel Next Element Search. IPPS 1997: 320- |
16 | EE | Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda: d-Dimensional Range Search on Multicomputers. IPPS 1997: 616-620 |
15 | Andrew Rau-Chaplin, Trevor J. Smedley: A Graphical Language for Generating Architectural Forms. VL 1997: 264-271 | |
1996 | ||
14 | 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) | |
1995 | ||
13 | EE | Frank K. H. A. Dehne, Andrew Rau-Chaplin, Afonso Ferreira: Hypercube Algorithms for Parallel Processing of Pointer-Based Quadtrees. Computer Vision and Image Understanding 62(1): 1-10 (1995) |
1994 | ||
12 | 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) | |
11 | 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) | |
10 | 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) | |
1993 | ||
9 | EE | 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 |
8 | EE | Laurence Boxer, Chun-Shi Chang, Russ Miller, Andrew Rau-Chaplin: Polygonal approximation by boundary reduction. Pattern Recognition Letters 14(2): 111-119 (1993) |
1992 | ||
7 | Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin: Parallel Fractional Cascading on Hypercube Multiprocessors. Comput. Geom. 2: 141-167 (1992) | |
1991 | ||
6 | 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 | |
5 | Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin: Efficient Parallel Construction and Manipulation of Quadtrees. ICPP (3) 1991: 255-262 | |
4 | EE | 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 |
1990 | ||
3 | 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) | |
2 | 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) | |
1989 | ||
1 | 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 |