engineering overlapping techniques for design. A pilot case study demonstrates the applicability of the proposed algorithm into the construction industry.

pro-pose a semi-supervised clustering algorithm, which leverages the accumulated user query log to guide the clustering pro-cess. Guided by the log file, our method arranges images into small groups and constructs a graph that captures the dissimilar relations between the groups. Each group is as

I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available

that links internal self-regulation, goal-directed effort, and goal attainment. Our purpose was to gain a better understanding of the reasons why followers of transformational leaders exhibit increased motivation, job satisfaction, organizational commitment, and job performance. We did this by testing one

and backchase

framework and cost model for evaluating merging. We prove that the problem is NP-hard and propose exhaustive algorithms and three heuristic algorithms: the Pair Merging Algorithm, the Directed Search Algorithm and the Clustering Algorithm. We develop a simulator, which uses geographical queries as a

interest in bulk-loading techniques. In contrast to previous approaches, our technique exploits a priori knowledge of the complete data set to improve both construction time and query performance. Our algorithm operates in a mannar similar to the Quicksort algorithm and has an average runtime

Collision Queries using Oriented Bounding Boxes Under the direction of Dinesh Manocha and Ming Lin Bounding volume hierarchies (BVHs) have been used widely in collision detection algorithms. The most commonly used bounding volume types are axis-aligned bounding boxes (AABBs) and spheres, which

expression. We propose a novel bi-clustering algorithm for generating non-overlapping clusters of reporter genes and conditions and demonstrate how this information can be interpreted in order to assist in the construction of transcription factor interaction networks. 1

consider the use of Generalized Ordered-Descendant Directed Acyclic Graphs (GODDAGs) for the purpose of storing and querying complex document-centric XML. GODDAGs are designed to store multihierarchical XML markup over the shared PCDATA content. They support representation of overlapping markup, which