Sciweavers

5138 search results - page 413 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
15 years 11 months ago
Detecting False Matches in String Matching Algorithms
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 ...
S. Muthukrishnan
DKE
2008
109views more  DKE 2008»
15 years 6 months ago
Deterministic algorithms for sampling count data
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...
Hüseyin Akcan, Alex Astashyn, Hervé Br...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 6 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
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...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 7 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
16 years 1 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen