SAGENERATE – A Visualization Tool for Generating Hypotheses (2008)
timchan at cs.ubc.ca As new technology emerges, so does the growth of datasets. The past decade has been marked by an unprecedented growth in experimental and computational biomedical data,...
Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammadtaghi Hajiaghayi, David R. Wood
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as possible. This...
Therese Biedl, Timothy Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai Golin, J. Ian Munro
In this paper we study greedy in-place sorting algorithms which miraculously happen to work in reasonable time. Dumb-Sort which repeatedly compares all possible pairs of array cells sorts n elements...
Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammadtaghi Hajiaghayi, David R. Wood
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as possible. This...
Fun-Sort --- Or the Chaos of Unordered (2007)
Binary Search Therese, Therese Biedl, Timothy Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai Golin, ...
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n elements in time #(n...
Balanced Vertex-Orderings of Graphs (2004)
Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammadtaghi Hajiaghayi, David R. Wood
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as...
Timothy Chan, Viet Le, Bojana Jankovic, Igor Naverniouk
In this analysis of the contact energies guiding the protein folding, the performance of the PERM algorithm on a simple, cubic lattice is examined when Miyazawa-Jernigan (MJ) and Hydrophobic-Polar...
Biedl, Therese, Chan, Timothy, Demaine, Erik D., Fleischer, Rudolf H., Golin, Mordecai J., Munro, J. Ian
In this paper we study greedy in-place sorting algorithms which miraculously happen to work in reasonable time. Dumb-Sort which repeatedly compares all possible pairs of array cells sorts n elements...
Balanced vertex-orderings of graphs (2001)
Therese Biedl, Timothy Chan, Mohammadtaghi Hajiaghayi, Yashar Ganjali
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbouts of each vertex v are as evenly distributed to the left and right of v as...
Balanced vertex-orderings of graphs (2001)
Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammadtaghi Hajiaghayi, David R. Wood
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbours of each vertex v are as evenly distributed to the left and right of v as...
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings (1997)
Chan, Timothy, Goodrich, Michael T., Kosaraju, Rao, Tamassia, Roberto
We investigate the problem of drawing an arbitrary n-node binary tree orthogonally in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while...
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings (1997)
Chan, Timothy, Goodrich, Michael T., Kosaraju, Rao, Tamassia, Roberto
We investigate the problem of drawing an arbitrary n-node binary tree orthogonally in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while...
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings (1997)
Chan, Timothy, Goodrich, Michael T., Kosaraju, Rao, Tamassia, Roberto
We investigate the problem of drawing an arbitrary n-node binary tree orthogonally in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while...
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings (1997)
Timothy Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
We investigate the problem of drawing an arbitrary n-node binary tree orthogonally in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while...
Fun-Sort --- Or the Chaos of Unordered (1994)
Binary Search Therese, Therese Biedl, Timothy Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai Golin, ...
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n elements in time #(n...
Paul Tillich and the question of God :--a philosophical appraisal /--by Timoty Chan. (1981)
Abstract (3 leaves) bound in.
Paul Tillich and the question of God :--a philosophical appraisal /--by Timoty Chan. (1981)
Thesis (Ph. D.)--University of Arkansas, Fayetteville, 1981.
Two problems in Spinoza's idea of substance. (1977)
Thesis (M.A.)--University of Arkansas, 1977.
Methods to improve the detection of mild cognitive impairment
Shankle, William R., Romney, A. Kimball, Hara, Junko, Fortier, Dennis, Dick, Malcolm B., Chen, James M., ...
We examined whether the performance of the National Institute of Aging's Consortium to Establish a Registry for Alzheimer's Disease's 10-word list (CWL), part of the consortium's neuropsychological...
A Theoretical Roadmap for Optical Lithography of Photonic Band Gap Microchips
This thesis presents designs and fabrication algorithms for 3D photonic band gap (PBG) material synthesis and embedded optical waveguide networks. These designs are suitable for large scale...