5153 search results - page 323 / 1031 » Introduction to Randomized Algorithms |
133
click to vote
STOC
1991
ACM
15 years 7 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
110
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present and evaluate GPU Bucket Sort, a parallel deterministic sample sort algorithm for many-core GPUs. Our method is considerably faster than Thrust Merge (Satish et.al., Pro...
143
click to vote
CPC
2006
15 years 4 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
142
click to vote
PTS
2010
15 years 2 months ago
2010
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
114
click to vote
ACL
2009
15 years 2 months ago
2009
It is usually assumed that the kind of noise existing in annotated data is random classification noise. Yet there is evidence that differences between annotators are not always ra...