7930 search results - page 494 / 1586 » Greedy in Approximation Algorithms |
160
click to vote
CSB
2005
IEEE
16 years 17 days ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
170
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
183
click to vote
ICCAD
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper considers simultaneous gate and wire sizing for general very large scale integrated (VLSI) circuits under the Elmore delay model. We present a fast and exact algorithm w...
211
click to vote
WSCG
2004
15 years 8 months ago
2004
Most of the existing algorithms for decimation of triangular meshes perform poorly at very low levels of detail. We propose a new automatic method for the decimation of triangular...
174
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...