2542 search results - page 221 / 509 » Computing Cartograms with Optimal Complexity |
87
Voted
GI
2007
Springer
15 years 6 months ago
2007
Springer
: In addition to the growing complexity of software systems, test effort takes increasing amounts of time and correspondingly more money. Testing costs may be reduced without compr...
89
Voted
SI3D
2006
ACM
15 years 6 months ago
2006
ACM
This paper presents a novel approach that uses graphics hardware to dynamically calculate a voxel-based representation of a scene. The voxelization is obtained on run-time in the ...
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
A radius–based separation of selection and recombination spheres in diffusion model EAs is introduced, enabling a new taxonomy, oriented towards information flow analysis. It a...
113
click to vote
AISC
1998
Springer
15 years 4 months ago
1998
Springer
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization....
103
Voted
IJCGA
2006
15 years 20 days ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...