Sciweavers

1375 search results - page 185 / 275
» Matching Points with Things
Sort
View
COMPGEOM
1998
ACM
15 years 5 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
74
Voted
COMPSAC
1996
IEEE
15 years 4 months ago
Optimal Linear Hashing Files for Orthogonal Range Retrieval
In this paper, we are concerned with the problem of designing optimal linear hashing files for orthogonal range retrieval. Through the study of performance expressions, we show th...
C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee, D....
69
Voted
KDD
1997
ACM
92views Data Mining» more  KDD 1997»
15 years 4 months ago
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
John M. Aronis, Foster J. Provost
109
Voted
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
15 years 4 months ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
SIGGRAPH
1992
ACM
15 years 4 months ago
Dynamic simulation of non-penetrating flexible bodies
A model for the dynamic simulation of flexible bodies subject to non-penetration constraints is presented. Flexible bodies are described in terms of global deformations of a rest ...
David Baraff, Andrew P. Witkin