Sciweavers

75 search results - page 10 / 15
» Optimal splitters for database partitioning with size bounds
Sort
View
JGTOOLS
2008
126views more  JGTOOLS 2008»
13 years 7 months ago
Simple Empty-Space Removal for Interactive Volume Rendering
Interactive volume rendering methods such as texture-based slicing techniques and ray-casting have been well developed in recent years. The rendering performance is generally restr...
Vincent Vidal 0002, Xing Mei, Philippe Decaudin
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 7 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
14 years 2 months ago
Region Sampling: Continuous Adaptive Sampling on Sensor Networks
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
Song Lin, Benjamin Arai, Dimitrios Gunopulos, Gaut...
PAKDD
2007
ACM
115views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Intelligent Sequential Mining Via Alignment: Optimization Techniques for Very Large DB
The shear volume of the results in traditional support based frequent sequential pattern mining methods has led to increasing interest in new intelligent mining methods to find mo...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
13 years 11 months ago
Sorting Multisets Stably in Minimum Space
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
Jyrki Katajainen, Tomi Pasanen