6437 search results - page 180 / 1288 » Parallel Algorithms for Arrangements |
104
Voted
PPSC
1997
15 years 4 months ago
1997
We present an overview of algorithms and data structures for dynamic re nement coarsening adaptation of unstructured FE meshes on loosely coupled parallel processors. We describ...
130
click to vote
JGO
2010
15 years 1 months ago
2010
Abstract The ability of the modern graphics processors to operate on large matrices in parallel can be exploited for solving constrained image deblurring problems in a short time. ...
130
Voted
MMM
2007
Springer
15 years 9 months ago
2007
Springer
Making a photo book as a special gift to your beloved can be very time-consuming. One has to carefully select and arrange the pictures nicely over the pages of a previously bought ...
113
Voted
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
113
click to vote
SSD
1993
Springer
15 years 7 months ago
1993
Springer
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...