Sciweavers

10608 search results - page 1956 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
EDBT
1998
ACM
155views Database» more  EDBT 1998»
14 years 2 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
14 years 2 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
14 years 2 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
DBPL
1997
Springer
90views Database» more  DBPL 1997»
14 years 2 months ago
Implementing Incremental View Maintenance in Nested Data Models
Previous research on materialized views has primarily been in the context of flat relational databases--materialized views defined in terms of one or more flat relations. This pape...
Akira Kawaguchi, Daniel F. Lieuwen, Inderpal Singh...
VISUALIZATION
1996
IEEE
14 years 2 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
« Prev « First page 1956 / 2122 Last » Next »