1165 search results - page 169 / 233 » Effective linear programming based placement methods |
164
click to vote
ICPP
1995
IEEE
15 years 6 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
120
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
136
click to vote
JMLR
2010
15 years 25 days ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
93
Voted
PLDI
2005
ACM
15 years 8 months ago
2005
ACM
A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus ...
119
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...