Sciweavers

7015 search results - page 1332 / 1403
» Approximation algorithms for co-clustering
Sort
View
VLDB
2001
ACM
139views Database» more  VLDB 2001»
14 years 1 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
ISPD
2000
ACM
131views Hardware» more  ISPD 2000»
14 years 1 months ago
Multi-center congestion estimation and minimization during placement
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
Maogang Wang, Xiaojian Yang, Kenneth Eguro, Majid ...
VISUALIZATION
1996
IEEE
14 years 1 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
SIGGRAPH
1996
ACM
14 years 1 months ago
Interactive Multiresolution Surface Viewing
Multiresolution analysis has been proposed as a basic tool supporting compression, progressive transmission, and level-of-detail control of complex meshes in a unified and theoret...
Andrew Certain, Jovan Popovic, Tony DeRose, Tom Du...
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
« Prev « First page 1332 / 1403 Last » Next »