Sciweavers

176 search results - page 15 / 36
» heuristics 1998
Sort
View
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
13 years 7 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
CORR
1998
Springer
98views Education» more  CORR 1998»
13 years 7 months ago
Statistical Models for Unsupervised Prepositional Phrase Attachment
We present several unsupervised statistical models for the prepositional phrase attachment task that approach the accuracy of the best supervised methods for this task. Our unsupe...
Adwait Ratnaparkhi
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 11 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
TKDE
1998
100views more  TKDE 1998»
13 years 7 months ago
Scalability Analysis of Declustering Methods for Multidimensional Range Queries
E cient storage and retrieval of multi-attribute datasets have become one of the essential requirements for many data-intensive applications. The Cartesian product le has been kno...
Bongki Moon, Joel H. Saltz
IEEEPACT
1998
IEEE
13 years 11 months ago
Optimistic Register Coalescing
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
Jinpyo Park, Soo-Mook Moon