11561 search results - page 2245 / 2313 » Open Distributed Processing |
RECOMB
1998
Springer
14 years 1 months ago
1998
Springer
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...
VLDB
1998
ACM
14 years 1 months ago
1998
ACM
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...
DMKD
1997
ACM
14 years 1 months ago
1997
ACM
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
CIKM
1997
Springer
14 years 1 months ago
1997
Springer
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
VLDB
1997
ACM
14 years 1 months ago
1997
ACM
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...