6437 search results - page 267 / 1288 » Parallel Algorithms for Arrangements |
143
Voted
DNA
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Self-assembly is a process in which basic units aggregate under attractive forces to form larger compound structures. Recent theoretical work has shown that pseudo-crysta...
156
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
140
Voted
PDP
2003
IEEE
15 years 8 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 ...
123
click to vote
ISAAC
1997
Springer
15 years 7 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...
128
click to vote
SPAA
2009
ACM
16 years 4 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...