3206 search results - page 170 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
169
click to vote
SODA
2010
ACM
16 years 20 days ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
135
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
130
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
132
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
A new method for computing precise depth map estimates of 3D shape of a moving object is proposed. 3D shape recovery in motion stereo is formulated as a matching optimization prob...
116
click to vote
CC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in...