5115 search results - page 391 / 1023 » On Randomized Lanczos Algorithms |
175
Voted
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
185
click to vote
SWAT
2004
Springer
16 years 26 days ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
185
click to vote
CPM
1993
Springer
15 years 11 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
209
click to vote
DKE
2008
15 years 7 months ago
2008
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
209
Voted
SIGMOD
2008
ACM
15 years 7 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...