6105 search results - page 262 / 1221 » A Parallel Algorithm for Bound-Smoothing |
189
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper we present a novel model based approach to detect severely broken parallel lines in noisy textual documents. It is important to detect and remove these lines so the ...
177
click to vote
PDP
2003
IEEE
15 years 12 months ago
2003
IEEE
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
175
click to vote
ISAAC
1997
Springer
15 years 10 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
164
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
157
click to vote
ISAAC
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...