Sciweavers

10392 search results - page 1802 / 2079
» Introduction to Computer Science
Sort
View
SCCC
2003
IEEE
15 years 11 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
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...
Gonzalo Navarro, Nora Reyes
KCAP
2003
ACM
15 years 11 months ago
Learning programs from traces using version space algebra
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 ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
SENSYS
2003
ACM
15 years 11 months ago
Tracking a moving object with a binary sensor network
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,...
SMA
2003
ACM
151views Solid Modeling» more  SMA 2003»
15 years 11 months ago
An architecture for universal CAD data exchange
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...
Ari Rappoport
AGTIVE
2003
Springer
15 years 11 months ago
Local Specification of Surface Subdivision Algorithms
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....
« Prev « First page 1802 / 2079 Last » Next »