#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2004

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Trip Denton, M. Fatih Demirci, Jeff Abrahamson, Ali Shokoufandeh, Sven J. Dickinson
- Proceedings of the 17th International Conferenceâ€¦
- 2004

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),â€¦ (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â€¦ (More)

- Trip Denton, Jeff Abrahamson, Ali Shokoufandeh
- Proceedings of the 2004 IEEE Computer Societyâ€¦
- 2004

Given a set of patterns and a similarity measure between them, we would present an optimization framework to approximate a small subset, known as a canonical set, whose members closely resemble theâ€¦ (More)

- Nicu D. Cornea, Ulukbek Ibraev, +4 authors Sven J. Dickinson
- IEEE Visualization
- 2005

We present an algorithm and its implementation to perform secure incremental backups to untrusted servers. The algorithm avoids unencrypted data leaving the local host, but is nonetheless able toâ€¦ (More)

- Jeff Abrahamson, BÃ©la Csaba, Ali Shokoufandeh
- APPROX-RANDOM
- 2008

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.â€¦ (More)

- Adam J. Oâ€™Donnell, Bob Quinn, +13 authors M. Fatih Demirci
- 2005

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi ii Chapter 1. A Brief Overview of Computer Security . . . . . . . . . . . . . . . . 1 1.

- Jeff Abrahamson, Ali Shokoufandeh
- 2005 IEEE/RSJ International Conference onâ€¦
- 2005

We present a polynomial-time algorithm for a special case of the Euclidean traveling salesman problem in which a robot must visit all the vertices of two non-intersecting polygons without crossingâ€¦ (More)

- Jeff Abrahamson, Ali Shokoufandeh, Pawel Winter
- Inf. Process. Lett.
- 2005

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â€¦ (More)

- Jeff Abrahamson, Ali Shokoufandeh
- Theor. Comput. Sci.
- 2010

We give an O(nm+nm +m log m) time and O(n +m) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles in the Euclidean plane, where nâ€¦ (More)

- â€¹
- 1
- â€º