Výsledky vyhledávání - "Distributed approximation algorithm"

An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs

Autoři: Sayaka Kamei Tomoko Izumi Yukiko Yamauchi

Zdroj: Theoretical Computer Science. 615:102-119

Témata: Unit disk graph, 0202 electrical engineering, electronic engineering, information engineering, Unfair distributed daemon, Minimum connected dominating set, Distributed approximation algorithm, Safe convergence, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Self-stabilization, Theoretical Computer Science, Computer Science(all)

Deviation Estimation between Distributed Data Streams

Autoři: Anceaume, Emmanuelle Busnel, Yann

Přispěvatelé: Anceaume, Emmanuelle Busnel, Yann

Zdroj: 2014 Tenth European Dependable Computing Conference. :35-45

Témata: distributed approximation algorithm, Data stream model, DDoS attacks, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, correlation metric, 3. Good health

Popis souboru: application/pdf

Přístupová URL adresa: http://hal-institut-mines-telecom.archives-ouvertes.fr/docs/00/99/87/02/PDF/PID3096993.pdf
https://hal.science/hal-00998702v1
https://hal.science/hal-00998702v1/document
https://doi.org/10.1109/edcc.2014.27
http://ieeexplore.ieee.org/document/6821086/
https://ieeexplore.ieee.org/document/6821086/
https://dblp.uni-trier.de/db/conf/edcc/edcc2014.html#AnceaumeB14
https://doi.org/10.1109/EDCC.2014.27
https://hal.archives-ouvertes.fr/hal-00998702/document
https://hal.archives-ouvertes.fr/hal-00998702

Semi-asynchronous and distributed weighted connected dominating set algorithms for wireless sensor networks

Autoři: Erciyes K. Dagdeviren O. Tse S.

Zdroj: Computer Standards & Interfaces. 42:143-156

Témata: Backbone formation, Weighted connected dominating set, 0202 electrical engineering, electronic engineering, information engineering, Distributed approximation algorithm, 02 engineering and technology, 16. Peace & justice, Wireless sensor networks

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/csi/csi42.html#DagdevirenET15
https://doi.org/10.1016/j.csi.2015.05.005
https://www.sciencedirect.com/science/article/pii/S0920548915000677
http://netos.ube.ege.edu.tr/source/publications/csi15.pdf
https://hdl.handle.net/11454/17339
https://doi.org/10.1016/j.csi.2015.05.005

Lightweight Metric Computation for Distributed Massive Data Streams

Autoři: Anceaume, Emmanuelle Busnel, Yann Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE) a další

Přispěvatelé: Anceaume, Emmanuelle Busnel, Yann Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE) a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783662556955

Témata: statistical metric, [INFO.INFO-DC]Computer Science [cs]/Distributed, distributed approximation algorithm, Data stream model, and Cluster Computing [cs.DC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO]Computer Science [cs], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO] Computer Science [cs], Parallel, correlation metric

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01634353/file/ab-tldks2017.pdf
https://hal.science/hal-01634353v1/document
https://hal.science/hal-01634353v1
https://doi.org/10.1007/978-3-662-55696-2_1
https://link.springer.com/content/pdf/10.1007%2F978-3-662-55696-2_1.pdf
https://hal.archives-ouvertes.fr/hal-01634353/document
https://rd.springer.com/chapter/10.1007/978-3-662-55696-2_1
https://doi.org/10.1007/978-3-662-55696-2_1
https://link.springer.com/chapter/10.1007%2F978-3-662-55696-2_1
https://hal.archives-ouvertes.fr/hal-01634353

A fast distributed approximation algorithm for minimum spanning trees

Autoři: Maleq Khan Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Maleq Khan Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Zdroj: http://staff.vbi.vt.edu/maleq/papers/disc.pdf.

Témata: Distributed Approximation Algorithm, Minimum Spanning Tree

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.171; http://staff.vbi.vt.edu/maleq/papers/disc.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.171
http://staff.vbi.vt.edu/maleq/papers/disc.pdf

Approximation Algorithms for Channel Allocation Problems in Broadcast Networks

Autoři: Rajiv Gandhi The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Rajiv Gandhi The Pennsylvania State University CiteSeerX Archives

Zdroj: http://crab.rutgers.edu/~rajivg/publications/journal/networks06.ps.

Témata: channel allocation problem, edge partitioning problem, distributed approximation algorithm

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.5743; http://crab.rutgers.edu/~rajivg/publications/journal/networks06.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.5743
http://crab.rutgers.edu/~rajivg/publications/journal/networks06.ps

Exploiting user mobility for wireless content delivery

Autoři: Poularakis, K. Tassiulas, L.

Zdroj: http://www.scopus.com/inward/record.url?eid=2-s2.0-84890413562&partnerID=40&md5=eec9d4e3471527dd898ab5fc988bec4b.

Témata: Communication cell, Content delivery, Discrete time Markov chains, Distributed approximation algorithm, File delivery, Large deviations, Optimal solutions, Systematic experiment, Approximation algorithms, Information theory, Base stations

Relation: http://hdl.handle.net/11615/32421

Dostupnost: http://hdl.handle.net/11615/32421
https://doi.org/10.1109/ISIT.2013.6620380

Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings

Autoři: Urangan Kunal Talwar The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Urangan Kunal Talwar The Pennsylvania State University CiteSeerX Archives

Zdroj: http://staff.vbi.vt.edu/maleq/papers/distapprox.pdf.

Témata: Distributed Approximation Algorithm, Network Optimization, Probabilistic Tree Embedding, Least Element Lists, Generalized Steiner Forest Problem

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.1320; http://staff.vbi.vt.edu/maleq/papers/distapprox.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.1320
http://staff.vbi.vt.edu/maleq/papers/distapprox.pdf