8 Result(s)
within
Chapter
S. Muthukrishnan
Computer Science
Computation by Abstract Devices
Theory of Computation
-
Chapter and Conference Paper
Stochastic Data Streams
The classical data stream problems are now greatly understood [1]. This talk will focus on problems with stochastic (rather than deterministic) streams where the underlying physical phenomenon generates probab...
-
Chapter and Conference Paper
Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses
Given a signal A of N dimensions, the problem is to obtain a representation R for it that is a linear combination of vectors in the dictionary H of Haar wavelets. The quality of the representation R is determined...
-
Chapter and Conference Paper
Sublinear Methods for Detecting Periodic Trends in Data Streams
We present sublinear algorithms — algorithms that use significantly less resources than needed to store or process the entire input stream – for discovering representative trends in data streams in the form of...
-
Chapter and Conference Paper
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such as point, range, and inner product que...
-
Chapter and Conference Paper
Maintenance of Multidimensional Histograms
We present a space- and time- efficient algorithm for maintaining multidimensional histograms for data that is dynamic, i.e., subject to updates that may be increments or decrements. Both space used as well as...
-
Chapter and Conference Paper
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of the human genome sequence (and that...
-
Chapter and Conference Paper
Optimal parallel algorithms for Prefix Matching
The Prefix Matching Problem is to determine, for each location in the text t, the longest prefix of a given pattern p which occurs beginning at that location. We present two work-optimal parallel algorithms for t...
-
Chapter and Conference Paper
String matching under a general matching relation
In standard string matching, each symbol matches only itself. In other string matching problems, e.g., the string matching with “don't-cares” problem, a symbol may match several symbols. In general, an arbitra...
