3206 search results - page 140 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
118
click to vote
CGO
2007
IEEE
15 years 9 months ago
2007
IEEE
Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A ...
140
click to vote
EXPCS
2007
15 years 4 months ago
2007
Pipeline Spectroscopy is a new technique that allows us to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precis...
ICIP
2005
IEEE
16 years 4 months ago
2005
IEEE
Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morpholo...
126
click to vote
LCTRTS
2007
Springer
15 years 9 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
116
click to vote
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...