7648 search results - page 69 / 1530 » A Data Locality Optimizing Algorithm |
IJAIT
2010
14 years 8 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
106
click to vote
CONSTRAINTS
2008
14 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
MVA
2002
14 years 9 months ago
2002
Velocity Picking is the problem of picking velocity-time pairs based on a coherence metric between multiple seismic signals. Coherence as a function of velocity and time can be ex...