Výsledky vyhľadávania - "Streaming Algorithm"

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions

Autori: Venturin, Giorgio Sarpe, Ilie Vandin, Fabio

Zdroj: Machine Learning and Knowledge Discovery in Databases. Research Track - European Conference, ECML PKDD 2025, Proceedings. :244-262

Predmety: Streaming algorithm, Temporal networks, Temporal triangle counting

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-372790

Streaming Algorithms for Conflict-Free Coloring

Autori: Mathew, Rogers Panolan, Fahad Seshikanth a ďalší

Prispievatelia: Mathew, Rogers Panolan, Fahad Seshikanth a ďalší

Predmety: vertex coloring, randomized algorithms, Streaming algorithm, ddc:004, conflict-free coloring

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.44

Deterministic (2/3 - ε)-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries

Autori: Terao, Tatsuya Tatsuya Terao

Prispievatelia: Terao, Tatsuya Tatsuya Terao

Predmety: streaming algorithm, ddc:004, Matroid intersection, approximation algorithm

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.50

Streaming Diameter of High-Dimensional Points

Autori: Halldórsson, Magnús M. Matsakis, Nicolaos Veselý, Pavel a ďalší

Prispievatelia: Halldórsson, Magnús M. Matsakis, Nicolaos Veselý, Pavel a ďalší

Predmety: FOS: Computer and information sciences, coreset, streaming algorithm, Computer Science - Data Structures and Algorithms, minimum enclosing ball, Data Structures and Algorithms (cs.DS), ddc:004, diameter, farthest pair

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2505.16720
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.58

Simplification of Trajectory Streams

Autori: Cheng, Siu-Wing Huang, Haoqiang Jiang, Le a ďalší

Prispievatelia: Cheng, Siu-Wing Huang, Haoqiang Jiang, Le a ďalší

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, streaming algorithm, Computational Geometry, ddc:004, curve simplification, Fréchet distance

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2503.23025
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.34

Dynamic risk spillover networks and causal paths of steel product prices in China

Autori: LIU Guowei AN Haizhong TENG Beiyong

Zdroj: Ziyuan Kexue, Vol 46, Iss 11, Pp 2093-2107 (2024)

Predmety: steel products|risk spillover network|causal paths|streaming algorithm|dynamic characteristics, Environmental sciences, QH301-705.5, GE1-350, Biology (General)

Prístupová URL adresa: https://doaj.org/article/7270bf413f59484c9b079ce0be3ed705

Streaming Algorithms for Diversity Maximization with Fairness Constraints

Autori: Wang, Yanhao Fabbri, Francesco Mathioudakis, Michael a ďalší

Prispievatelia: Wang, Yanhao Fabbri, Francesco Mathioudakis, Michael a ďalší

Predmety: Computer and information sciences, algorithmic fairness, diversity maximization, max-min dispersion, streaming algorithm, APPROXIMATION ALGORITHMS

Popis súboru: application/pdf

Relation: 2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022); IEEE International Conference on Data Engineering; Suomen Akatemia Projektilaskutus; 322046; conference; http://hdl.handle.net/10138/594864; 85136450548; 000855078400004

Dostupnosť: http://hdl.handle.net/10138/594864

Deletion Robust Non-Monotone Submodular Maximization over Matroids

Autori: Dütting P. Fusco F. Lattanzi S. a ďalší

Prispievatelia: Dütting P. Fusco F. Lattanzi S. a ďalší

Predmety: approximation algorithm, deletion robust, randomized algorithm, streaming algorithm, Submodular maximization

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001492433900001; volume:26; firstpage:1; lastpage:28; numberofpages:28; journal:JOURNAL OF MACHINE LEARNING RESEARCH; https://hdl.handle.net/11573/1751911

Dostupnosť: https://hdl.handle.net/11573/1751911

Random indexing of multidimensional data

Autori: Sandin, Fredrik Emruli, Blerim Sahlgren, Magnus

Zdroj: Knowledge and Information Systems. 52(1):267-290

Predmety: Data mining, Dimensionality reduction, Natural language processing, Random embeddings, Semantic similarity, Sparse coding, Streaming algorithm

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-30273
https://doi.org/10.1007/s10115-016-1012-2

Streaming Algorithms for Diversity Maximization with Fairness Constraints

Autori: Fabbri Francesco Mathioudakis Michael Wang Yanhao a ďalší

Prispievatelia: Fabbri Francesco Mathioudakis Michael Wang Yanhao a ďalší

Zdroj: 2022 IEEE 38th International Conference on Data Engineering (ICDE). :41-53

Predmety: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer and information sciences, max-min dispersion, APPROXIMATION ALGORITHMS, streaming algorithm, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 02 engineering and technology, diversity maximization, algorithmic fairness, Machine Learning (cs.LG)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2208.00194
http://hdl.handle.net/10138/594864

Streaming Matching and Edge Cover in Practice

Autori: Ferdous, S M Pothen, Alex Halappanavar, Mahantesh a ďalší

Prispievatelia: Ferdous, S M Pothen, Alex Halappanavar, Mahantesh a ďalší

Predmety: Semi-Streaming Algorithm, Parallel Algorithms, Matching, Algorithm Engineering, ddc:004, Edge Cover

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.12

Dynamic L-Budget Clustering of Curves

Autori: Buchin, Kevin Buchin, Maike Gudmundsson, Joachim a ďalší

Prispievatelia: Buchin, Kevin Buchin, Maike Gudmundsson, Joachim a ďalší

Zdroj: Buchin, K, Buchin, M, Gudmundsson, J, Plätz, L, Thiel, L & Wong, S 2024, Dynamic L-Budget Clustering of Curves . in H L Bodlaender (ed.), 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 ., 18, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 294, 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024, Helsinki, Finland, 12/06/2024 . https://doi.org/10.4230/LIPIcs.SWAT.2024.18

Predmety: streaming algorithm, simplification, ddc:004, approximation algorithms, polygonal curves, storage efficiency, clustering, Fréchet distance

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.18
https://curis.ku.dk/ws/files/395153655/Dynamic_L_Budget_Clustering_of_Curves.pdf

Efficient Incremental Computation of Aggregations over Sliding Windows

Autori: Zhang, Chao Akbarinia, Reza Toumani, Farouk

Prispievatelia: Zhang, Chao Akbarinia, Reza Toumani, Farouk

Zdroj: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. :2136-2144

Predmety: Data Stream, 0202 electrical engineering, electronic engineering, information engineering, Sliding Window Aggregation, [INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR], 02 engineering and technology, Streaming Algorithm

Popis súboru: application/pdf

Prístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-03359490/file/PBA_KDD_21.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03468587v1
https://dblp.uni-trier.de/db/conf/kdd/kdd2021.html#0045AT21
https://kdd.org/kdd2021/accepted-papers#64
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03359490
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03359490/document

Complete Subhedge Projection for Stepwise Hedge Automata

Autori: Antonio Al Serhali Joachim Niehren

Zdroj: Algorithms, Vol 17, Iss 8, p 339 (2024)

Predmety: automata, projection algorithm, streaming algorithm, Xml, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

Relation: https://www.mdpi.com/1999-4893/17/8/339; https://doaj.org/toc/1999-4893; https://doaj.org/article/55ceda0c709b4907aad3674779a29775

Dostupnosť: https://doi.org/10.3390/a17080339
https://doaj.org/article/55ceda0c709b4907aad3674779a29775

Optimality of Linear Sketching Under Modular Updates

Autori: Hosseini, Kaave Lovett, Shachar Yaroslavtsev, Grigory

Zdroj: 34TH COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2019). 137

Predmety: communication complexity, linear sketching, streaming algorithm, 46 Information and computing sciences (for-2020)

Prístupová URL adresa: https://escholarship.org/uc/item/48t5j207

Stream Concept-cognitive Computing System for Streaming Data Learning

Autori: Yunlong Mi

Predmety: Artificial intelligence, Perspective (graphical), Concept drift, Mathematical analysis, Upper and lower bounds, Cognition, Artificial Intelligence, Data Streams, Machine learning, Data stream, FOS: Mathematics, Streaming algorithm, Adaptation to Concept Drift in Data Streams, Data mining, Biology, Ensemble Learning, Streaming Data, Concept Drift, Data stream mining, Neural Network Fundamentals and Applications, Computer science, Process (computing), Operating system, Online Learning, Streaming data, Computer Science, Physical Sciences, Telecommunications, Mathematics, Neuroscience

Maximum Coverage in Random-Arrival Streams

Autori: Warneke, Rowan Choudhury, Farhana Wirth, Anthony a ďalší

Prispievatelia: Warneke, Rowan Choudhury, Farhana Wirth, Anthony a ďalší

Predmety: Random Arrival, Greedy Algorithm, Communication Complexity, ddc:004, Streaming Algorithm, Maximum Coverage

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.102

Oblivious Algorithms for the Max-kAND Problem

Autori: Singer, Noah G. Noah G. Singer

Prispievatelia: Singer, Noah G. Noah G. Singer

Predmety: factor-revealing linear program, streaming algorithm, constraint satisfaction problem (CSP), ddc:004, approximation algorithm

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.15

Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching

Autori: Liu, S. Cliff Song, Zhao Zhang, Hengjie a ďalší

Prispievatelia: Liu, S. Cliff Song, Zhao Zhang, Hengjie a ďalší

Predmety: Convex optimization, interior point method, streaming algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.88

Dostupnosť: https://doi.org/10.4230/LIPIcs.ICALP.2023.88
https://nbn-resolving.org/urn:nbn:de:0030-drops-181408
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.88

A method of traffic balancing in SDN networks based on a modified distance vector routing protocol

Zdroj: Problems of Informatization and Control; Vol. 2 No. 74 (2023); 62-67
Проблемы информатизации и управления; Том 2 № 74 (2023); 62-67
Проблеми iнформатизацiї та управлiння; Том 2 № 74 (2023); 62-67

Predmety: програмно-конфігуровані мережі, багатошляхова маршрутизація, streaming algorithm, алгоритм потокового передавання, multipath routing, балансування трафіку, traffic balancing, software-defined networking

Popis súboru: application/pdf

Prístupová URL adresa: https://jrnl.nau.edu.ua/index.php/PIU/article/view/17883