1439 search results - page 146 / 288 » Fast approximation of centrality |
115
Voted
ICDE
2006
IEEE
15 years 6 months ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
90
Voted
ICCSA
2005
Springer
15 years 6 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 ...
101
click to vote
ICDM
2003
IEEE
15 years 6 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...
132
click to vote
FOCS
1998
IEEE
15 years 5 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...
88
Voted
SACRYPT
1998
Springer
15 years 5 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 (...