Sciweavers

694 search results - page 23 / 139
» On the Dimensions of Data Complexity through Synthetic Data ...
Sort
View
VLDB
2004
ACM
178views Database» more  VLDB 2004»
14 years 2 months ago
High-Dimensional OLAP: A Minimal Cubing Approach
Data cube has been playing an essential role in fast OLAP (online analytical processing) in many multi-dimensional data warehouses. However, there exist data sets in applications ...
Xiaolei Li, Jiawei Han, Hector Gonzalez
ISNN
2004
Springer
14 years 2 months ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
SMA
2008
ACM
155views Solid Modeling» more  SMA 2008»
13 years 8 months ago
Filament tracking and encoding for complex biological networks
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...
David Mayerich, John Keyser
DPD
2006
141views more  DPD 2006»
13 years 8 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
IGIS
1994
118views GIS» more  IGIS 1994»
14 years 27 days ago
Surface Modelling with Guaranteed Consistency - An Object-Based Approach
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...
Christopher M. Gold, Thomas Roos