The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
In this paper we examine the role of very simple and noisy sensors for the tracking problem. We propose a binary sensor model, where each sensor’s value is converted reliably to...
Javed A. Aslam, Zack J. Butler, Florin Constantin,...
Parametric feature-based CAD data exchange is one of the most important open problems in solid modeling. The problem is significant and challenging both scientifically and comme...
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
Colin Smith, Przemyslaw Prusinkiewicz, Faramarz F....