1982 search results - page 28 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
208
Voted
ISCA
2002
IEEE
15 years 1 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
117
Voted
HIS
2008
15 years 3 months ago
2008
This paper proposes a methodology to generate artificial data sets to evaluate the behavior of machine learning techniques. The methodology relies in the definition of a domain an...
108
Voted
PPOPP
2009
ACM
16 years 2 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
121
Voted
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
130
click to vote
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...