Sciweavers

7758 search results - page 1477 / 1552
» On the Number of Distributive Lattices
Sort
View
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
14 years 2 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
HOTOS
1997
IEEE
14 years 2 months ago
The Flux OS Toolkit: Reusable Components for OS Implementation
To an unappreciated degree, research both in operating systems andtheirprogramminglanguageshasbeen severely hampered by the lack of cleanly reusable code providing mundanelow-leve...
Bryan Ford, Kevin Van Maren, Jay Lepreau, Stephen ...
RECOMB
1998
Springer
14 years 2 months ago
The hierarchical organization of molecular structure computations
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altma...
VLDB
1998
ACM
147views Database» more  VLDB 1998»
14 years 2 months ago
Architecture of Oracle Parallel Server
Oracle Parallel Server (OPS) is a shared disk RDBMS. We present a high level overview of the main architectural issues of OPS and their evolution throughout the releases of the Or...
Roger Bamford, D. Butler, Boris Klots, N. MacNaugh...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 2 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...
« Prev « First page 1477 / 1552 Last » Next »