3206 search results - page 280 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
113
click to vote
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
Rate-Distortion optimization can significantly improve encoder performance in MPEG-like video coding applications especially when it is applied to coding mode selection and motion...
114
Voted
STOC
1999
ACM
15 years 7 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
135
click to vote
SC
2005
ACM
15 years 9 months ago
2005
ACM
The paper proposes a novel approach for optimizing performance of all-to-all collective communication by taking advantage of concurrency available in modern networks such as Infin...
111
Voted
WSC
1998
15 years 4 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
152
Voted
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...