5115 search results - page 315 / 1023 » On Randomized Lanczos Algorithms |
191
click to vote
FOCS
2002
IEEE
16 years 7 days ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
185
click to vote
STOC
1991
ACM
15 years 10 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...
163
click to vote
CORR
2010
Springer
15 years 7 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...
193
click to vote
CPC
2006
15 years 7 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...
207
click to vote
PTS
2010
15 years 5 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...