1951 search results - page 177 / 391 » An algorithm for improving graph partitions |
138
Voted
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems. Prev...
138
Voted
DAC
2005
ACM
15 years 7 months ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
117
click to vote
PAAPP
2006
15 years 5 months ago
2006
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
173
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
148
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...