1538 search results - page 70 / 308 » Spectral Techniques in Graph Algorithms |
123
click to vote
WEA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
113
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
DATE
1998
IEEE
15 years 5 months ago
1998
IEEE
Partial Scan techniques have been widely accepted as an effective solution to improve sequential ATPG performance while keeping acceptable area and performance overheads. Several ...
103
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...