6542 search results - page 1028 / 1309 » The tao of parallelism in algorithms |
191
click to vote
COCO
2005
Springer
16 years 8 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
182
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
181
click to vote
SIAMSC
2008
15 years 6 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
167
click to vote
CVIU
2004
15 years 6 months ago
2004
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
206
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
We present Propagation Networks (P-Nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activi...