Algorithms for ε-approximations of Terrains ⋆ (2009)
Abstract. Consider a point set D with a measure function µ: D → R. Let A be the set of subsets of D induced by containment in a shape from some geometric family (e.g. axis-aligned rectangles, half...
Jeff M. Phillips, Advisor Pankaj, K. Agarwal
Advisor: Pankaj K. Agarwal. Worked on computational geometry (coresets, shape matching), computational statistics, computational biology, databases. Yahoo! Research (Research Intern) (Summer 2007)...
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers ⋆ (2009)
Pankaj K. Agarwal, Jeff M. Phillips
Abstract. For a set P of n points in R 2, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem where we...
Small and Stable Descriptors of Distributions for Geometric Statistical Problems by (2009)
This thesis explores how to sparsely represent distributions of points for geometric statistical problems. A coreset C is a small summary of a point set P such that if a certain statistic is computed...
Spatial Scan Statistics for Graph Clustering (2009)
Bei Wang, Jeff M. Phillips, Robert Schreiber, Dennis Wilkinson
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected edges in a subgraph....
Small and Stable Descriptors of Distributions for Geometric Statistical Problems (2009)
Dissertation
Shape Fitting on Point Sets with Probability Distributions (2008)
Loffler, Maarten, Phillips, Jeff M.
A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed...
Spatial Scan Statistics for Graph Clustering (2008)
Bei Wang, Jeff M. Phillips, Robert Schreiber, Dennis Wilkinson
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected edges in a subgraph....
Matching via Power Diagrams (2008)
A Voronoi diagram of a set of points (called sites) S is a partitioning of R d into regions such that all points in a region are closer to a specific point s than any other point in S. Formally, for...
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers (2008)
Agarwal, Pankaj K., Phillips, Jeff M.
For a set P of n points in R^2, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2,k)-center problem where we compute the...
Let there be two computers, Alice and Bob. Alice and Bob are both given a string of n bits. Together they want to compute some boolean function F: {0,1} n × {0,1} n → {0,1}. Both Alice and Bob...
1 Introduction The Hunting of the Bump: On Maximizing Statistical Discrepancy (2008)
Deepak Agarwal, Jeff M. Phillips, Suresh Venkatasubramanian
Anomaly detection has important applications in biosurveilance and environmental monitoring. When comparing
Algorithms for eps-approximations of Terrains (2008)
Consider a point set D with a measure function w : D -> R. Let A be the set of subsets of D induced by containment in a shape from some geometric family (e.g. axis-aligned rectangles, half planes,...
Consider a point set D with a measure functionµ: D→R. Let A be the set of subsets of D induced by containment in a shape from some geometric family (e.g. axis-parallel rectangles, half planes,...
Jeff M. Phillips, Lydia E. Kavraki
This paper presents a probabilistic approach to solve optimal control problems with application to spacecraft proximity operations. The 6 degree-of-freedom rendezvous and docking problem, using...
Value-based notification conditions in large-scale publish/subscribe systems. InVLDB (2007)
Badrish Chandramouli, Jeff M. Phillips, Jun Yang
We address the problem of providing scalable support for subscriptions with personalized value-based notification conditions in widearea publish/subscribe systems. Notification conditions can be...
Value-based notification conditions in large-scale publish/subscribe systems. InVLDB (2007)
Badrish Chandramouli, Jeff M. Phillips, Jun Yang
We address the problem of providing scalable support for subscriptions with personalized value-based notification conditions in widearea publish/subscribe systems. Notification conditions can be...
Outlier Robust ICP for Minimizing Fractional RMSD (2006)
Phillips, Jeff M., Liu, Ran, Tomasi, Carlo
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms because (1) in...
Outlier robust ICP for minimizing fractional RMSD (2006)
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms because (1) in...
Outlier robust ICP for minimizing fractional RMSD (2006)
Jeff M. Phillips, Ran Liu, Carlo Tomasi
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms because (1) in...
Outlier robust ICP for minimizing fractional RMSD (2006)
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms because (1) in...
The Hunting of the Bump: On Maximizing Statistical Discrepancy (2006)
Deepak Agarwal, Jeff M. Phillips, Suresh Venkatasubramanian
Anomaly detection has important applications in biosurveilance and environmental monitoring. When comparing measured data to data drawn from a baseline distribution, merely, finding clusters in the...
The Hunting of the Bump: On Maximizing Statistical Discrepancy (2006)
Deepak Agarwal, Jeff M. Phillips, Suresh Venkatasubramanian
Anomaly detection has important applications in biosurveilance and environmental monitoring. When comparing measured data to data drawn from a baseline distribution, merely, finding clusters in the...
Segmenting motifs in protein-protein interface surfaces (2006)
Jeff M. Phillips, Johannes Rudolph, Pankaj K. Agarwal
Abstract. Protein-protein interactions form the basis for many intercellular events. In this paper we develop a tool for understanding the structure of these interactions. Specifically, we define a...
The Hunting of the Bump: On Maximizing Statistical Discrepancy (2005)
Agarwal, Deepak, Phillips, Jeff M., Venkatasubramanian, Suresh
Anomaly detection has important applications in biosurveilance and environmental monitoring. When comparing measured data to data drawn from a baseline distribution, merely, finding clusters in the...
Jeff M. Phillips, Fabian Schwarzer, Mitul Saha
A common subroutine in robotics, especially path planning, is to check for collisions between the robot and obstacles along a planned route of the robot. In fact, this is often the bottleneck in most...
I plan to present some interesting ways to represent motion in SE(3), the space of all rigid body transformations (rotations and translations). It can in fact be easily be decomposed into a...
Jeff M. Phillips, David P. Dobkin, Dimitrious Gunopulos, Wolfgang Maass Computing
Consider a set of n red points R, and a set of n blue points B which lie in the plane. Let B(R) be the number of blue points in a region R, and similarly let R(R) be the number of red points in R....
Survey of Absolute Orientation Techniques (2004)
The Absolute Orientation problem minimizes the mean squared error between two matched points sets under rigid-body transformations. More verbosely, a free point set A is matched to a fixed point set...
Jeff M. Phillips, Thomas H. Cormen, Charles E. Leiserson
Union-Find is a simple and incredibly useful algorithm for finding connected sets in a graph, G = (V, E) that is often taught in an advanced algorithms class. Where n = |V | and m = |E|, Union-Find...
Abstract — Motion planning for systems with constraints on controls or the need for relatively straight paths for real-time actions presents challenges for modern planners. This paper presents an...
Probabilistic Roadmaps (PRM) [1] is an algorithm for finding a collision-free path in a known environment. It works by sampling possible configurations qi of the robot in the configuration space, C,...
Jeff M. Phillips, Nazareth Bedrossian, Lydia E. Kavraki
Motion planning for systems with constraints on controls or the need for relatively straight paths for real-time actions presents challenges for modern planners. This paper presents an approach which...
FingerPrinting and its Geometric Implications (2003)
The technique of FingerPrinting uses a randomly chosen map, F (x) or often Fp(x), on elements from a large, possibly infinite set S, to a smaller finite set of buckets B. Some important...
Spatial scan statistics: Approximations and performance study (1991)
Deepak Agarwal, Suresh Venkatasubramanian, Andrew Mcgregor, Jeff M. Phillips, Zhengyuan Zhu
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invested in designing...