7129 search results - page 1352 / 1426 » Approximation Algorithms for Treewidth |
ISPD
2000
ACM
15 years 2 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 ...
VISUALIZATION
1996
IEEE
15 years 2 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...
SIGGRAPH
1996
ACM
15 years 2 months ago
1996
ACM
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...
STOC
1993
ACM
15 years 1 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...
COMPGEOM
2007
ACM
15 years 1 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 ...