1951 search results - page 218 / 391 » An algorithm for improving graph partitions |
140
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
177
click to vote
VALUETOOLS
2006
ACM
15 years 11 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
169
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
124
click to vote
INFOCOM
2007
IEEE
15 years 12 months ago
2007
IEEE
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
137
click to vote
ISQED
2006
IEEE
15 years 11 months ago
2006
IEEE
— In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. The new method is based on the sequence of linea...