Sciweavers

VLDB
1999
ACM
224views Database» more  VLDB 1999»
14 years 4 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
RT
1999
Springer
14 years 4 months ago
Real-Time Rendering of Real World Environments
: One of the most important goals of interactive computer graphics is to allow a user to freely walk around a virtual recreation of a real environment that looks as real as the wor...
David K. McAllister, Lars S. Nyland, Voicu Popescu...
CGI
1998
IEEE
14 years 4 months ago
Deformable Surfaces for Feature Based Indirect Volume Rendering
In this paper we present an indirect volume visualization method, based on the deformable surface model, which is a three dimensional extension of the snake segmentation method. I...
Christoph Lürig, Leif Kobbelt, Thomas Ertl
VISUALIZATION
1999
IEEE
14 years 4 months ago
Hierarchical Parallel Coordinates for Exploration of Large Datasets
Our ability to accumulate large, complex (multivariate) data sets has far exceeded our ability to effectively process them in search of patterns, anomalies, and other interesting ...
Ying-Huey Fua, Matthew O. Ward, Elke A. Rundenstei...
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
14 years 5 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
MSS
1999
IEEE
137views Hardware» more  MSS 1999»
14 years 5 months ago
Overview of a TRW Pilot Program
Recently TRW fielded a prototype system for a government customer. It provides a wide range of capabilities including data collection, hierarchical storage, automated distribution...
William A. Olsen
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
14 years 5 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
IPPS
1999
IEEE
14 years 5 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka
IDEAS
1999
IEEE
175views Database» more  IDEAS 1999»
14 years 5 months ago
A Parallel Scalable Infrastructure for OLAP and Data Mining
Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health-care among many others. The mu...
Sanjay Goil, Alok N. Choudhary
DEXA
2000
Springer
102views Database» more  DEXA 2000»
14 years 5 months ago
Extending the Re-use of Query Results at Remote Client Sites
In 'Associative Caching' each client computer keeps a copy of its query result sets in its own local database. The purpose is to reduce the size and frequency of queries ...
Jerome Robinson, Barry G. T. Lowden