2834 search results - page 292 / 567 » Representing Trees with Constraints |
208
click to vote
ALENEX
2001
15 years 8 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
157
click to vote
ALENEX
2003
15 years 8 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
174
click to vote
NIPS
2003
15 years 8 months ago
2003
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
186
click to vote
GISCIENCE
2010
Springer
15 years 7 months ago
2010
Springer
Regions which evolve over time are a significant aspect of many phenomena in geographic information science. Examples include areas in which a measured value (e.g. temperature, sal...
198
click to vote
CGF
2008
15 years 6 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...