![]() | 2009 | |
---|---|---|
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Umar Qasim, Vincent Oria, Yi-fang Brook Wu, Michael E. Houle, M. Tamer Özsu: A partial-order based active cache for recommender systems. RecSys 2009: 209-212 |
2008 | ||
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle: The Relevant-set Correlation Model for Data Clustering. SDM 2008: 775-786 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle: The Relevant-Set Correlation Model for Data Clustering. Statistical Analysis and Data Mining 1(3): 157-176 (2008) |
2007 | ||
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Nizar Grira: A correlation-based model for unsupervised feature selection. CIKM 2007: 897-900 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Duy-Dinh Le, Shin'ichi Satoh, Michael E. Houle, Dat Phuoc Tat Nguyen: Finding Important People in Large News Video Databases Using Multimodal and Clustering Analysis. ICDE Workshops 2007: 127-136 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Duy-Dinh Le, Shin'ichi Satoh, Michael E. Houle: Boosting Face Retrieval by using Relevant Set Correlation Clustering. ICME 2007: 524-527 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Nizar Grira, Michael E. Houle: Best of both: a hybridized centroid-medoid clustering heuristic. ICML 2007: 313-320 |
2006 | ||
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Duy-Dinh Le, Shin'ichi Satoh, Michael E. Houle: Face Retrieval in Broadcasting News Video by Fusing Temporal and Intensity Information. CIVR 2006: 391-400 |
2005 | ||
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Jun Sakuma: Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets. ICDE 2005: 619-630 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo: Graphs of Triangulations and Perfect Matchings. Graphs and Combinatorics 21(3): 325-331 (2005) |
2004 | ||
34 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
2003 | ||
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle: Navigating massive data sets via local clustering. KDD 2003: 547-552 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Yasuhiko Morimoto, Masaki Aono, Michael E. Houle, Kevin S. McCurley: Extracting Spatial Knowledge from the Web. SAINT 2003: 326-333 |
2002 | ||
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Antonios Symvonis, David R. Wood: Dimension-Exchange Algorithms for Load Balancing on Trees. SIROCCO 2002: 181-196 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | M. Carmen Hernando, Michael E. Houle, Ferran Hurtado: On local transformation of polygons with visibility properties. Theor. Comput. Sci. 289(2): 919-937 (2002) |
2001 | ||
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Kevin Pulo, Michael E. Houle: Evaluation of Virtual World Systems. Australian Software Engineering Conference 2001: 98-107 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Carsten Friedrich, Michael E. Houle: Graph Drawing in Motion II. Graph Drawing 2001: 220-231 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Tim Menzies, John D. Powell, Michael E. Houle: Fast Formal Analysis of Requirements via "Topoi Diagrams". ICSE 2001: 391-400 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Estivill-Castro, Michael E. Houle: Data Structures for Minimization of Total Within-Group Distance for Spatio-temporal Clustering. PKDD 2001: 91-102 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Estivill-Castro, Michael E. Houle: Robust Distance-Based Clustering with Applications to Spatial Data Mining. Algorithmica 30(2): 216-242 (2001) |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
2000 | ||
23 | ![]() ![]() ![]() ![]() ![]() ![]() | M. Carmen Hernando, Michael E. Houle, Ferran Hurtado: On Local Transformation of Polygons with Visibility Properties. COCOON 2000: 54-63 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Estivill-Castro, Michael E. Houle: Fast Randomized Algorithms for Robust Estimation of Location. TSDM 2000: 77-88 |
1999 | ||
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Estivill-Castro, Michael E. Houle: Robust Clustering of Large Data Sets with Categorial Attributes. Australasian Database Conference 1999: 165-176 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Binay K. Bhattacharya, Michael E. Houle: Generalized Maximum Independent Sets for Trees in Subquadratic Time. ISAAC 1999: 435-445 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Estivill-Castro, Michael E. Houle: Robust Clustering of Large Geo-referenced Data Sets. PAKDD 1999: 327-337 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
1998 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Richard Webber: Approximation Algorithms for Finding Best Viewpoints. Graph Drawing 1998: 210-223 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Gavin Turner: Dimension-Exchange Token Distribution on the Mesh and the Torus. Parallel Computing 24(2): 247-265 (1998) |
1997 | ||
14 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Eades, Michael E. Houle, Richard Webber: Finding the Best Viewpoints for Three-Dimensional Graph Drawings. Graph Drawing 1997: 87-98 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle: Ethics, programming, and virtual environments. ITiCSE 1997: 91-93 |
1996 | ||
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Gavin Turner: Dimension-Exchange Token Distribution on the Mesh and the Torus. ISAAC 1996: 285-294 |
1995 | ||
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Sándor P. Fekete, Michael E. Houle, Sue Whitesides: New Results on a Visibility Representation of Graphs in 3D. Graph Drawing 1995: 234-241 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | David Avis, Michael E. Houle: Computational aspects of Helly's theorem and its relatives. Int. J. Comput. Geometry Appl. 5(4): 357-367 (1995) |
1994 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint: Every Set of Disjoint Line Segments Admits a Binary Tree. ISAAC 1994: 20-28 |
1993 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides: Dominance Drawings of Bipartite Graphs. CCCG 1993: 187-191 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto: Orthogonal Weighted Linear L1 and Linfty Approximation and Applications. Discrete Applied Mathematics 43(3): 217-232 (1993) |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle: Algorithms for Weak and Wide Separation of Sets. Discrete Applied Mathematics 45(2): 139-159 (1993) |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Gen-Huey Chen, Michael E. Houle, Ming-Ter Kuo: The steiner problem in distributed computing systems. Inf. Sci. 74(1-2): 73-96 (1993) |
1991 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle: Theorems on the Existence of Separating Surfaces. Discrete & Computational Geometry 6: 49-56 (1991) |
1989 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert: Weighted Orthogonal Linear L\infty-Approximation and Applications. WADS 1989: 183-193 |
1988 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael E. Houle, Godfried T. Toussaint: Computing the Width of a Set. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 761-765 (1988) |