3206 search results - page 39 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
132
click to vote
EMSOFT
2010
Springer
15 years 8 days ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
162
click to vote
JMLR
2012
13 years 4 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
99
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
121
Voted
ESA
2001
Springer
15 years 6 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
131
click to vote
ICIP
2007
IEEE
15 years 8 months ago
2007
IEEE
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...