We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
— We consider the problem of tracking multiple moving robots using noisy sensing of inter-robot and interbeacon distances. Sensing is local: there are three fixed beacons at kno...
Jeremy Schiff, Erik B. Sudderth, Kenneth Y. Goldbe...
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...