5153 search results - page 111 / 1031 » Introduction to Randomized Algorithms |
121
click to vote
SC
2005
ACM
15 years 8 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
153
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
134
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
117
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
145
click to vote
KDD
2009
ACM
15 years 7 months ago
2009
ACM
We develop and evaluate an approach to causal modeling based on time series data, collectively referred to as“grouped graphical Granger modeling methods.” Graphical Granger mo...