Sciweavers

2020 search results - page 73 / 404
» Speeding up Slicing
Sort
View
SIGMOD
2005
ACM
89views Database» more  SIGMOD 2005»
14 years 3 months ago
Stacked indexed views in microsoft SQL server
Appropriately selected materialized views (also called indexed views) can speed up query execution by orders of magnitude. Most database systems limit support for materialized vie...
David DeHaan, Per-Åke Larson, Jingren Zhou
VLDB
1994
ACM
121views Database» more  VLDB 1994»
14 years 2 months ago
The Impact of Global Clustering on Spatial Database Systems
Global clustering has rarely been investigated in the area of spatial database systems although dramatic performance improvements can be achieved by using suitable techniques. In ...
Thomas Brinkhoff, Hans-Peter Kriegel
AI
2002
Springer
13 years 10 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
CGF
2000
127views more  CGF 2000»
13 years 9 months ago
Interactive High-Quality Maximum Intensity Projection
Maximum Intensity Projection (MIP) is a volume rendering technique which is used to visualize high-intensity structures within volumetric data. At each pixel the highest data valu...
Lukas Mroz, Helwig Hauser, Eduard Gröller
ICIP
2002
IEEE
14 years 11 months ago
Reduced DCT approximations for low bit rate coding
Transform approximations are explored for speeding up the software compression of images and video. Faster approximations are used to replace the regular DCT whenever only few DCT...
Ricardo L. de Queiroz