1951 search results - page 64 / 391 » An algorithm for improving graph partitions |
IMR
2003
Springer
15 years 9 months ago
2003
Springer
The 8-tetrahedra longest-edge (8T-LE) partition of any tetrahedron is defined in terms of three consecutive edge bisections, the first one performed by the longest-edge. The ass...
144
click to vote
NIPS
2004
15 years 5 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
133
click to vote
EGH
2004
Springer
15 years 7 months ago
2004
Springer
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
116
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
131
click to vote
ICCAD
1996
IEEE
15 years 8 months ago
1996
IEEE
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...