7006 search results - page 1332 / 1402 » Approximation Algorithms |
111
click to vote
VLDB
2001
ACM
15 years 6 months ago
2001
ACM
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...
112
click to vote
ISPD
2000
ACM
15 years 6 months ago
2000
ACM
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 ...
120
Voted
VISUALIZATION
1996
IEEE
15 years 6 months ago
1996
IEEE
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...
126
click to vote
STOC
1993
ACM
15 years 6 months ago
1993
ACM
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...
115
click to vote
COMPGEOM
2007
ACM
15 years 6 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...