1021 search results - page 119 / 205 » Fast Approximate PCPs |
109
click to vote
ICCSA
2005
Springer
15 years 8 months ago
2005
Springer
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
117
click to vote
ICDM
2003
IEEE
15 years 8 months ago
2003
IEEE
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...
149
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
114
click to vote
SACRYPT
1998
Springer
15 years 7 months ago
1998
Springer
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
142
click to vote
VMV
2001
15 years 4 months ago
2001
The theoretical aspects are discussed of our developed software, MeshToSS, for the conversion to Loop subdivision surfaces of dense triangular meshes. This software generates subd...