6437 search results - page 214 / 1288 » Parallel Algorithms for Arrangements |
102
click to vote
ENDM
2008
15 years 3 months ago
2008
We highlight intriguing analogies between the diameter of a polytope and the largest possible total curvature of the associated central path. We prove continuous analogues of the ...
105
Voted
IEICET
2006
15 years 3 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
124
click to vote
TVCG
2008
15 years 3 months ago
2008
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link...
144
click to vote
PVM
1998
Springer
15 years 7 months ago
1998
Springer
The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered. Three almost optimal Monte Carlo algorithms are presented:
139
click to vote
PDIS
1993
IEEE
15 years 7 months ago
1993
IEEE
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...