Sciweavers

339 search results - page 16 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 26 days ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
92
Voted
ICIC
2005
Springer
15 years 3 months ago
Borderline-SMOTE: A New Over-Sampling Method in Imbalanced Data Sets Learning
In recent years, mining with imbalanced data sets receives more and more attentions in both theoretical and practical aspects. This paper introduces the importance of imbalanced da...
Hui Han, Wenyuan Wang, Binghuan Mao
IPPS
2006
IEEE
15 years 3 months ago
Algorithm-based checkpoint-free fault tolerance for parallel matrix computations on volatile resources
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
Zizhong Chen, Jack Dongarra
FOCS
2008
IEEE
15 years 4 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
PPSN
2004
Springer
15 years 3 months ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart