#### Filter Results:

#### Publication Year

2004

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Given a collection of sets of 2-D views of 3-D objects and a similarity measure between them, we present a method for summarizing the sets using a small subset called a bounded canonical set (BCS), whose members best represent the members of the original set. This means that members of the BCS are as dissimilar from each other as possible, while at the same… (More)

In this paper we detail the use of e-mail social network analysis for the detection of security policy violations on computer systems. We begin by formalizing basic policies that derive from the expected social behavior of computer users. We then extract the social networks of three organizations by analyzing e-mail server logs collected over several months… (More)

Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members closely resemble the members of the original set. We will present a combinatorial formulation of the canon-ical set problem in terms of quadratic optimization integer programming,… (More)

We present a polynomial-time algorithm for a variant of the Euclidean traveling salesman tour where n vertices are on the boundary of a convex polygon P and m vertices form the boundary of a convex polygonal obstacle Q completely contained within P. In the worst case the algorithm needs O(m 2 lg m + m 2 n) time and O(nm + m 2) space.

In this paper we will consider tight upper and lower bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of its cardinality. Specifically, given two n sets of points R = {r1, ..., rn} and B = {b1, ..., bn} distributed uniformly and randomly on the m leaves of λ-Hierarchically Separated… (More)

ii Acknowledgements First and foremost I would like to thank my advisor Ali Shokoufandeh for his patient help and advice during this ongoing journey. Béla Csaba also deserves special thanks for the many long hours we spent working together developing some of the probabilistic matching theory that has made its way into this work and become so much of its… (More)

We give an O(n 2 m + nm 2 + m 2 log m) time and O(n 2 + m 2) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles in the Euclidean plane, where n and m are the number of vertices of the two polygons.

- Adam J. O’Donnell, Afshin Daryoush, Maja Bystrom, Athina Petropulu, Vassilis Prevelakis, Steven Weber +6 others
- 2005

ii Dedications This dissertation is dedicated to my parents, Joseph and Monica, for instilling in me the thirst for knowledge that has led me to this point, and to my wife Sophy for providing me with the love and support I needed to see me through. iii Acknowledgments