2314 search results - page 153 / 463 » Minimal Partitions of a Graph |
145
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...
168
click to vote
WG
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
144
click to vote
SAC
2005
ACM
15 years 12 months ago
2005
ACM
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
158
click to vote
ISPD
2003
ACM
15 years 11 months ago
2003
ACM
Traditional multilevel partitioning approaches have shown good performance with respect to cutsize, but offer no guarantees with respect to system performance. Timing-driven part...
179
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Visualizing time-varying volume data take both large s...