Sciweavers

3206 search results - page 170 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 3 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
ICPR
2008
IEEE
16 years 28 days ago
Medical image segmentation via min s-t cuts with sides constraints
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...
Jiun-Hung Chen, Linda G. Shapiro
BMCBI
2010
137views more  BMCBI 2010»
15 years 6 months ago
Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
Michael L. Sierk, Michael E. Smoot, Ellen J. Bass,...
CVPR
2000
IEEE
16 years 8 months ago
Improved Motion Stereo Matching Based on a Modified Dynamic Programming
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...
Mikhail Mozerov, Vitaly Kober, Tae-Sun Choi
CC
2004
Springer
15 years 12 months ago
Region-Based Partial Dead Code Elimination on Predicated Code
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...
Qiong Cai, Lin Gao 0002, Jingling Xue