Search results

...rness]], and [[inapproximability]].{{r|appointed}} She holds the chair for Algorithms and Data Structures in the Computer Science Department at [[Heinrich Heine ...([[Dr. rer. nat.]]) in 2014 with the dissertation ''Coresets and streaming algorithms for the {{nowrap|<math>k</math>-means}} problem and related clustering obje ...

[[Category:Streaming algorithms]] ...

...thm is considered one of the precursors of [[Streaming algorithm|streaming algorithms]], and the more general problem of determining the frequency moments of a d [[Category:Randomized algorithms]] ...

...nancial transactions etc. Data stream clustering is usually studied as a [[streaming algorithm]] and the objective is, given a sequence of points, to construct ..., [[k-means clustering|k-means]] is a widely used heuristic but alternate algorithms have also been developed such as [[k-medoids]], [[CURE data clustering algo ...

...math> x_i </math> should be minimized. In such a case, several [[streaming algorithms]] have been proposed that use a fixed number of storage units. ==Streaming algorithms== ...

...Data Stream Summary: The Count-Min Sketch and its Applications |journal=J. Algorithms |year=2005 |volume=55 |pages=29–38 |url=http://dimacs.rutgers.edu/~graham/p ...he various types cannot decrease over time. Modifications of the following algorithms exist for the more general case where frequencies are allowed to decrease.} ...

...Applications of silence compression include [[telecommunications]], audio streaming, voice recognition, audio archiving, and media production.<ref name=":1">{{ ...truncated or completely removed. Some common amplitude threshold trimming algorithms are:{{cn|date=November 2023}} ...

...te journal |doi=10.1016/0022-0000(85)90041-8 |title=Probabilistic counting algorithms for data base applications |journal=Journal of Computer and System Sciences To analyze the complexity, the data streaming <math>(\epsilon,\delta)</math> model<ref name="Heule13">{{cite web|url=http ...

...' forms of this terminology exist, by reversing all inequalities. For some algorithms, recovery might be easier for block models with assortative or disassortati The goal of detection algorithms is simply to determine, given a sampled graph, whether the graph has latent ...

{{Short description|Class of algorithms operating on data streams}} ...ed in only a few passes, typically [[one-pass algorithm|just one]]. These algorithms are designed to operate with limited memory, generally [[L (complexity)|log ...

...o nearly-tight bounds on the [[approximation ratio]] of streaming matching algorithms.{{r|gkk12|k13|k15|fhs}} | journal = Random Structures & Algorithms ...

== Algorithms == ...be done in [[linear time]] and [[space complexity|constant space]] by a [[streaming algorithm]]. It suffices, for each <math>1\le i < n-k</math>, to keep track ...

...ta |date=2022 |title=Modeling and Mining Multi-Aspect Graphs With Scalable Streaming Tensor Decomposition |class=cs.SI |eprint=2210.04404}}</ref> ...

...orithm for Estimating the Entropy of a Stream|journal= ACM Transactions on Algorithms|volume=6|issue=3|pages=1–21|doi=10.1145/1798596.1798604|issn=1549-6325|cite ...

...ia.fr/flajolet/Publications/DuFl03-LNCS.pdf |accessdate=2016-12-11 |title= Algorithms - ESA 2003 |volume=2832 |pages=605 |series=Lecture Notes in Computer Scienc * [[Streaming algorithm]] ...

...e)|Ampere]] microarchitectures, featuring a new [[Streaming Multiprocessor|streaming multiprocessor]], a faster memory subsystem, and a transformer acceleration ...0 billion transistors. It consists of up to 144 [[Streaming Multiprocessor|streaming multiprocessor]]s.{{Sfn|Elster|Haugdahl|2022|p=4}} Due to the increased mem ...

...rst proposed by Sarlos.<ref>{{cite conference|title=Improved approximation algorithms for large matrices via random projections | conference = FOCS'06 |last1 = S ...avid P.|year=2017| arxiv = 1710.11253 }}</ref><ref>{{cite conference|title=Algorithms for Lp Low-Rank Approximation | conference = ICML'17 | last1 = Chierichetti ...

...twise operations, which can also be applied to compressed bloom filters if streaming compression is used. ...10.1007/3-540-44676-1_10 | title = Proc. 9th Annual European Symposium on Algorithms (ESA 2001) | series = Lecture Notes in Computer Science | volume = 2161 | p ...

|title=Cache-Oblivious streaming B-trees |journal=Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures ...

== Algorithms == ...mple random sampling have been developed.<ref>{{Cite book|title = Sampling Algorithms - Springer|date = 2006-01-01|doi = 10.1007/0-387-34240-0|isbn = 978-0-387-3 ...