6437 search results - page 494 / 1288 » Parallel Algorithms for Arrangements |
157
Voted
SMA
2003
ACM
15 years 10 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
156
Voted
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
147
Voted
HICSS
2008
IEEE
15 years 5 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
156
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Many physical and artificial phenomena can be described by time series. The prediction of such phenomenon could be as complex as interesting. There are many time series forecasti...
124
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Abstract. Themain contributionof thiswork isto propose a numberof broadcastefficient VLSI architectures for computing the sum and the prefix sums of a w k-bit, k 2, binary sequenc...