| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Michael E. Houle Michael E. Houle, Jun Sakuma : Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets. ICDE 2005 : 619-630 Michael E. Houle, Antonios Symvonis , David R. Wood : Dimension-exchange algorithms for token distribution on tree-connected architectures. J. Parallel Distrib. Comput. 64 (5): 591-605 (2004) Michael E. Houle: Navigating massive data sets via local clustering. KDD 2003 : 547-552 Yasuhiko Morimoto , Masaki Aono , Michael E. Houle, Kevin S. McCurley : Extracting Spatial Knowledge from the Web. SAINT 2003 : 326-333 Michael E. Houle, Antonios Symvonis , David R. Wood : Dimension-Exchange Algorithms for Load Balancing on Trees. SIROCCO 2002 : 181-196 M. Carmen Hernando , Michael E. Houle, Ferran Hurtado : On local transformation of polygons with visibility properties. Theor. Comput. Sci. 289 (2): 919-937 (2002) Kevin Pulo , Michael E. Houle: Evaluation of Virtual World Systems. Australian Software Engineering Conference 2001 : 98-107 Carsten Friedrich , Michael E. Houle: Graph Drawing in Motion II. Graph Drawing 2001 : 220-231 Tim Menzies , John Powell , Michael E. Houle: Fast Formal Analysis of Requirements via "Topoi Diagrams". ICSE 2001 : 391-400 Vladimir Estivill-Castro , Michael E. Houle: Data Structures for Minimization of Total Within-Group Distance for Spatio-temporal Clustering. PKDD 2001 : 91-102 Vladimir Estivill-Castro , Michael E. Houle: Robust Distance-Based Clustering with Applications to Spatial Data Mining. Algorithmica 30 (2): 216-242 (2001) Prosenjit Bose , Michael E. Houle, Godfried T. Toussaint : Every Set of Disjoint Line Segments Admits a Binary Tree. Discrete & Computational Geometry 26 (3): 387-410 (2001) M. Carmen Hernando , Michael E. Houle, Ferran Hurtado : On Local Transformation of Polygons with Visibility Properties. COCOON 2000 : 54-63 Vladimir Estivill-Castro , Michael E. Houle: Fast Randomized Algorithms for Robust Estimation of Location. TSDM 2000 : 77-88 Vladimir Estivill-Castro , Michael E. Houle: Robust Clustering of Large Data Sets with Categorial Attributes. Australasian Database Conference 1999 : 165-176 Binay K. Bhattacharya , Michael E. Houle: Generalized Maximum Independent Sets for Trees in Subquadratic Time. ISAAC 1999 : 435-445 Vladimir Estivill-Castro , Michael E. Houle: Robust Clustering of Large Geo-referenced Data Sets. PAKDD 1999 : 327-337 Michael E. Houle, Ewan D. Tempero , Gavin Turner : Optimal Dimension-Exchange Token Distribution on Complete Binary Trees. Theor. Comput. Sci. 220 (2): 363-376 (1999) Michael E. Houle, Richard Webber : Approximation Algorithms for Finding Best Viewpoints. Graph Drawing 1998 : 210-223 Prosenjit Bose , Hazel Everett , Sándor P. Fekete , Michael E. Houle, Anna Lubiw , Henk Meijer , Kathleen Romanik , Günter Rote , Thomas C. Shermer , Sue Whitesides , Christian Zelle : A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2 (2): (1998) Michael E. Houle, Gavin Turner : Dimension-Exchange Token Distribution on the Mesh and the Torus. Parallel Computing 24 (2): 247-265 (1998) Sándor P. Fekete , Michael E. Houle, Sue Whitesides : The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. Graph Drawing 1997 : 272-283 Peter Eades , Michael E. Houle, Richard Webber : Finding the Best Viewpoints for Three-Dimensional Graph Drawings. Graph Drawing 1997 : 87-98 Michael E. Houle, Gavin Turner : Dimension-Exchange Token Distribution on the Mesh and the Torus. ISAAC 1996 : 285-294 Sándor P. Fekete , Michael E. Houle, Sue Whitesides : New Results on a Visibility Representation of Graphs in 3D. Graph Drawing 1995 : 234-241 David Avis , Michael E. Houle: Computational aspects of Helly's theorem and its relatives. Int. J. Comput. Geometry Appl. 5 (4): 357-367 (1995) Prosenjit Bose , Michael E. Houle, Godfried T. Toussaint : Every Set of Disjoint Line Segments Admits a Binary Tree. ISAAC 1994 : 20-28 Hossam A. ElGindy , Michael E. Houle, William Lenhart , Mirka Miller , David Rappaport , Sue Whitesides : Dominance Drawings of Bipartite Graphs. CCCG 1993 : 187-191 Michael E. Houle, Hiroshi Imai , Keiko Imai , Jean-Marc Robert , Peter Yamamoto : Orthogonal Weighted Linear L 1 and L infty Approximation and Applications. Discrete Applied Mathematics 43 (3): 217-232 (1993) Michael E. Houle: Algorithms for Weak and Wide Separation of Sets. Discrete Applied Mathematics 45 (2): 139-159 (1993) Gen-Huey Chen , Michael E. Houle, Ming-Ter Kuo : The steiner problem in distributed computing systems. Inf. Sci. 74 (1-2): 73-96 (1993) Michael E. Houle: Theorems on the Existence of Separating Surfaces. Discrete & Computational Geometry 6 : 49-56 (1991) Michael E. Houle, Hiroshi Imai , Keiko Imai , Jean-Marc Robert : Weighted Orthogonal Linear L \infty -Approximation and Applications. WADS 1989 : 183-193 Michael E. Houle, Godfried T. Toussaint : Computing the Width of a Set. IEEE Trans. Pattern Anal. Mach. Intell. 10 (5): 761-765 (1988) 1 [ 31 ] 2 [ 9 ] 3 [ 19 ] 4 [ 8 ] [ 15 ] [ 23 ] 5 [ 4 ] 6 [ 12 ] 7 [ 7 ] 8 [ 18 ] [ 20 ] [ 21 ] [ 24 ] [ 25 ] 9 [ 15 ] 10 [ 10 ] [ 13 ] [ 15 ] 11 [ 27 ] 12 [ 22 ] [ 29 ] 13 [ 22 ] [ 29 ] 14 [ 2 ] [ 6 ] 15 [ 2 ] [ 6 ] 16 [ 4 ] 17 [ 7 ] 18 [ 15 ] 19 [ 31 ] 20 [ 15 ] 21 [ 26 ] 22 [ 7 ] 23 [ 31 ] 24 [ 26 ] 25 [ 28 ] 26 [ 7 ] 27 [ 2 ] [ 6 ] 28 [ 15 ] 29 [ 15 ] 30 [ 34 ] 31 [ 15 ] 32 [ 30 ] [ 33 ] 33 [ 17 ] 34 [ 1 ] [ 8 ] [ 23 ] 35 [ 11 ] [ 14 ] [ 17 ] 36 [ 12 ] [ 16 ] 37 [ 7 ] [ 10 ] [ 13 ] [ 15 ] 38 [ 30 ] [ 33 ] 39 [ 6 ] 40 [ 15 ]  ©2006 Association for Computing Machinery |
