Sciweavers

9842 search results - page 1902 / 1969
» Problem complexity
Sort
View
ICPP
2000
IEEE
14 years 3 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
IPPS
2000
IEEE
14 years 3 months ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
SIGGRAPH
2000
ACM
14 years 3 months ago
Plenoptic sampling
This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematica...
Jinxiang Chai, Shing-Chow Chan, Heung-Yeung Shum, ...
VRML
2000
ACM
14 years 3 months ago
A spatial hierarchical compression method for 3D streaming animation
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
Toshiki Hijiri, Kazuhiro Nishitani, Tim Cornish, T...
AI
2000
Springer
14 years 3 months ago
Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
Qiang Yang, Jing Wu
« Prev « First page 1902 / 1969 Last » Next »