Suchergebnisse - "sketching algorithm"

PiqSketch: An Efficient Sketching Algorithm for Per-Key Tail Quantile Estimation in Large-Scale Data Streams

Autoren: Yuheng Zhou Guoju Gao Yu-E Sun et al.

Quelle: Lecture Notes in Computer Science ISBN: 9789819608393

CBA Sketch: A Sketching Algorithm Mining Persistent Batches in Data Streams

Autoren: Qian Zhou Yu-E Sun He Huang et al.

Quelle: Lecture Notes in Computer Science ISBN: 9789819708109

An Improved Sketching Algorithm for Edit Distance

Autoren: Jin, Ce Nelson, Jelani Wu, Kewen

Schlagwörter: edit distance, sketching

Zugangs-URL: https://escholarship.org/uc/item/2p1465kt

Efficient Sketching Algorithm for Sparse Binary Data

Autoren: Rameshwar Pratap Karthik Revanuru Debajyoti Bera

Quelle: 2019 IEEE International Conference on Data Mining (ICDM). :508-517

Schlagwörter: Computer Science - Machine Learning, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Computer Science - Information Retrieval

Zugangs-URL: http://arxiv.org/pdf/1910.04658
http://arxiv.org/abs/1910.04658
https://arxiv.org/abs/1910.04658
http://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-04658
https://doi.org/10.1109/ICDM.2019.00061
https://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-04658
https://arxiv.org/pdf/1910.04658.pdf
https://www.arxiv-vanity.com/papers/1910.04658/

A Robot Portraits Pencil Sketching Algorithm Based on Face Component and Texture Segmentation

Autoren: Huicui Chen Jinsong Yang Qiaochu Gao et al.

Quelle: 2019 IEEE International Conference on Industrial Technology (ICIT). :48-53

Schlagwörter: 0209 industrial biotechnology, 02 engineering and technology

Zugangs-URL: https://dblp.uni-trier.de/db/conf/icit2/icit2019.html#GaoCYYD19

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Autoren: Cho, Younghyun Demmel, James Dereziński, Michał et al.

Quelle: SIAM Journal on Matrix Analysis and Applications. 46(2)

Schlagwörter: 4901 Applied Mathematics (for-2020), 49 Mathematical Sciences (for-2020), randomized numerical linear algebra, sketching algorithm, autotuning, least squares problem, Bayesian optimization, 0102 Applied Mathematics (for), 0103 Numerical and Computational Mathematics (for), Numerical & Computational Mathematics (science-metrix), 4901 Applied mathematics (for-2020)

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/85s5z8tj
https://escholarship.org/content/qt85s5z8tj/qt85s5z8tj.pdf

Efficient Sketching Algorithm for Sparse Binary Data

Autoren: Pratap, Rameshwar Bera, Debajyoti Revanuru, Karthik

Index Begriffe: Computer Science - Information Retrieval, Computer Science - Machine Learning, text

URL: http://arxiv.org/abs/1910.04658

PeriodicPipe: A Hardware-Friendly Sketching Algorithm for Mining Periodic Flows in High-Speed Data Streams

Autoren: Zhou, Qian Sun, Yu-E Huang, He et al.

Quelle: IEEE Transactions on Computational Social Systems ; page 1-12 ; ISSN 2329-924X 2373-7476

Verfügbarkeit: https://doi.org/10.1109/tcss.2025.3616170
http://xplorestaging.ieee.org/ielx8/6570650/6780646/11219661.pdf?arnumber=11219661

A Sketching Algorithm for Spectral Graph Sparsification

Autoren: Chen, Jiecao Qin, Bo Woodruff, David P. et al.

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/1412.8225

A simple sketching algorithm for entropy estimation

Autoren: Clifford, Peter Cosma, Ioana Ada

Schlagwörter: FOS: Computer and information sciences, FOS: Mathematics, Mathematics - Statistics Theory, Statistics Theory (math.ST), 0101 mathematics, Statistics - Computation, 01 natural sciences, Computation (stat.CO)

Zugangs-URL: http://arxiv.org/abs/0908.3961

On Frequent Directions, A Streaming Matrix Sketching Algorithm

Autoren: Ghashami, Mina

Schlagwörter: Engineering, Computer engineering, Computer science

Fast In-kernel Traffic Sketching in eBPF

Autoren: Miano, Sebastiano Chen, Xiaoqi Basat, Ran Ben et al.

Quelle: ACM SIGCOMM Computer Communication Review. 53:3-13

Schlagwörter: Sketching Algorithm, Sketch, Software Switch, eBPF, XDP

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/11311/1236624
https://doi.org/10.1145/3594255.3594256
https://dl.acm.org/doi/abs/10.1145/3594255.3594256
https://discovery-pp.ucl.ac.uk/id/eprint/10188362/

Large-Scale Beamforming for Massive MIMO via Randomized Sketching

Autoren: Hayoung Choi Tao Jiang Yuanming Shi et al.

Quelle: IEEE Transactions on Vehicular Technology. 70:4669-4681

Schlagwörter: Regularized zero-forcing beamforming, 0202 electrical engineering, electronic engineering, information engineering, Sketching method, 02 engineering and technology, Massive MIMO, Randomized sketching algorithm, 7. Clean energy

Zugangs-URL: http://arxiv.org/pdf/1903.05904
https://arxiv.org/abs/1903.05904
https://dblp.uni-trier.de/db/journals/tvt/tvt70.html#ChoiJSLZL21
http://ieeexplore.ieee.org/document/9398557
https://ieeexplore.ieee.org/document/9398557
https://www.arxiv-vanity.com/papers/1903.05904/
https://doi.org/10.1109/TVT.2021.3071543

A simple sketching algorithm for entropy estimation

Autoren: Peter Clifford Ioana Ada Cosma The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Peter Clifford Ioana Ada Cosma The Pennsylvania State University CiteSeerX Archives

Quelle: http://arxiv.org/pdf/0908.3961v1.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.249.4648; http://arxiv.org/pdf/0908.3961v1.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.249.4648
http://arxiv.org/pdf/0908.3961v1.pdf

On Constructing Spanners from Random Gaussian Projections

Autoren: Assadi, Sepehr Kapralov, Michael Yu, Huacheng et al.

Weitere Verfasser: Assadi, Sepehr Kapralov, Michael Yu, Huacheng et al.

Schlagwörter: sketching algorithm, lower bound, graph spanner

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.57

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.57
https://nbn-resolving.org/urn:nbn:de:0030-drops-188821
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.57

On Constructing Spanners from Random Gaussian Projections

Autoren: Assadi, Sepehr Kapralov, Michael Yu, Huacheng et al.

Weitere Verfasser: Assadi, Sepehr Kapralov, Michael Yu, Huacheng et al.

Schlagwörter: FOS: Computer and information sciences, sketching algorithm, graph spanner, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, lower bound, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2209.14775
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.57

Deterministic Heavy Hitters with Sublinear Query Time

Autoren: Li, Yi Nakos, Vasileios Yi Li and Vasileios Nakos

Weitere Verfasser: Li, Yi Nakos, Vasileios Yi Li and Vasileios Nakos

Schlagwörter: heavy hitters, turnstile model, sketching algorithm, strongly explicit

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 116, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.18
https://nbn-resolving.org/urn:nbn:de:0030-drops-94221
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.18

Streaming Complexity of SVMs

Autoren: Andoni, Alexandr Burns, Collin Li, Yi et al.

Weitere Verfasser: Andoni, Alexandr Burns, Collin Li, Yi et al.

Schlagwörter: support vector machine, streaming algorithm, space lower bound, sketching algorithm, point estimation

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.50

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.50
https://nbn-resolving.org/urn:nbn:de:0030-drops-126532
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.50

Sketching Approximability of All Finite CSPs.

Autoren: Chou, Chi-Ning Golovnev, Alexander Sudan, Madhu et al.

Quelle: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-74, 74p

Schlagwörter: CONSTRAINT satisfaction, BOOLEAN functions, SEPARATION of variables, FOURIER analysis, APPROXIMATION algorithms, COMMUNICATION barriers, HYPERCUBES

Deterministic Heavy Hitters with Sublinear Query Time

Autoren: Li, Yi Nakos, Vasileios School of Physical and Mathematical Sciences et al.

Weitere Verfasser: Li, Yi Nakos, Vasileios School of Physical and Mathematical Sciences et al.

Schlagwörter: FOS: Computer and information sciences, strongly explicit, 0102 computer and information sciences, 02 engineering and technology, Turnstile Model, 01 natural sciences, sketching algorithm, Computer Science - Data Structures and Algorithms, Heavy Hitters, 0202 electrical engineering, electronic engineering, information engineering, Science::Mathematics [DRNTU], Data Structures and Algorithms (cs.DS), ddc:004, turnstile model, heavy hitters

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1712.01971
https://ui.adsabs.harvard.edu/abs/2017arXiv171201971L/abstract
https://dr.ntu.edu.sg/handle/10220/46207
https://dblp.uni-trier.de/db/journals/corr/corr1712.html#abs-1712-01971
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.18
https://arxiv.org/pdf/1712.01971.pdf
https://arxiv.org/abs/1712.01971
http://hdl.handle.net/10220/46207
https://hdl.handle.net/10356/89241
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.18