| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Mario A. Lopez Hak-Cheol Kim , Mario A. Lopez, Scott T. Leutenegger , Ki-Joune Li : Efficient Declustering of Non-uniform Multidimensional Data Using Shifted Hilbert Curves. DASFAA 2004 : 694-707 Sahar Idwan , Dinesh P. Mehta , Mario A. Lopez: Fast Pursuit Of Mobile Nodes Using TPR Trees. Int. J. Found. Comput. Sci. 15 (5): 753-772 (2004) Mario A. Lopez, Bradford G. Nickerson : Analysis of half-space range search using the k -d search skip list. CCCG 2002 : 58-62 Mario A. Lopez, Shlomo Reisner : Linear time approximation of 3D convex polytopes. Comput. Geom. 23 (3): 291-301 (2002) Swanwa Liao , Mario A. Lopez, Scott T. Leutenegger : High Dimensional Similarity Search With Space Filling Curves. ICDE 2001 : 615-622 Swanwa Liao , Mario A. Lopez, Dinesh P. Mehta : Constrained polygon transformations for incremental floorplanning. ACM Trans. Design Autom. Electr. Syst. 6 (3): 322-342 (2001) Scott T. Leutenegger , Rostislav M. Sheykhet , Mario A. Lopez: A mechanism to detect changing access patterns and automatically migrate distributed R-tree indexed multidimensional data. ACM-GIS 2000 : 147-152 Mario A. Lopez, Swanwa Liao : Finding k-Closest-Pairs Efficiently for High Dimensional Data. CCCG 2000 Simonas Saltenis , Christian S. Jensen , Scott T. Leutenegger , Mario A. Lopez: Indexing the Positions of Continuously Moving Objects. SIGMOD Conference 2000 : 331-342 Scott T. Leutenegger , Mario A. Lopez: The Effect of Buffering on the Performance of R-Trees. IEEE Trans. Knowl. Data Eng. 12 (1): 33-44 (2000) Mario A. Lopez, Shlomo Reisner : Efficient Approximation of Convex Polygons. Int. J. Comput. Geometry Appl. 10 (5): 445-452 (2000) Yváan J. Garcia , Mario A. Lopez, Scott T. Leutenegger : Post-Optimization and Incremental Refinement of R-Trees. ACM-GIS 1999 : 91-96 Mario A. Lopez, Shlomo Reisner : Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids. J. Algorithms 33 (1): 140-165 (1999) Yván J. García , Mario A. Lopez, Scott T. Leutenegger : A Greedy Algorithm for Bulk Loading R-Trees. ACM-GIS 1998 : 163-164 Scott T. Leutenegger , Mario A. Lopez: The Effect of Buffering on the Performance of R-Trees. ICDE 1998 : 164-171 Yván J. García , Mario A. Lopez, Scott T. Leutenegger : On Optimal Node Splitting for R-trees. VLDB 1998 : 334-344 Mario A. Lopez, Shlomo Reisner : A Special Case of Mahler's Conjecture. Discrete & Computational Geometry 20 (2): 163-177 (1998) Scott T. Leutenegger , J. M. Edgington , Mario A. Lopez: STR: A Simple and Efficient Algorithm for R-Tree Packing. ICDE 1997 : 497-506 Mario A. Lopez, Dinesh P. Mehta : Partitioning Algorithms for Corner Stitching. Great Lakes Symposium on VLSI 1996 : 200- Scott T. Leutenegger , Mario A. Lopez: A Buffer Model for Evaluating the Performance of R-Tree Packing Algorithms. SIGMETRICS 1996 : 264-265 Mario A. Lopez, Dinesh P. Mehta : Efficient decomposition of polygons into L-shapes with application to VLSI layouts. ACM Trans. Design Autom. Electr. Syst. 1 (3): 371-395 (1996) 1 [ 4 ] 2 [ 10 ] 3 [ 6 ] [ 8 ] 4 [ 20 ] 5 [ 13 ] 6 [ 21 ] 7 [ 2 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 10 ] [ 12 ] [ 13 ] [ 15 ] [ 17 ] [ 21 ] 8 [ 21 ] 9 [ 14 ] [ 16 ] [ 17 ] 10 [ 1 ] [ 3 ] [ 16 ] [ 20 ] 11 [ 19 ] 12 [ 5 ] [ 9 ] [ 11 ] [ 18 ] 13 [ 13 ] 14 [ 15 ]  ©2005 Association for Computing Machinery |
