Search Results - "Randomized approximation algorithm"

Byzantine-tolerant uniform node sampling service in large-scale networks

Authors: Anceaume, Emmanuelle Busnel, Yann Sericola, Bruno

Contributors: Anceaume, Emmanuelle Busnel, Yann Sericola, Bruno

Source: International Journal of Parallel, Emergent and Distributed Systems. 36:412-439

Subject Terms: Markov chains, Uniform sampling, Randomized approximation algorithm, Data stream, [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], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], 0102 computer and information sciences, 02 engineering and technology, Byzantine nodes, 01 natural sciences

File Description: application/pdf

Access URL: https://hal-imt-atlantique.archives-ouvertes.fr/hal-03265593/file/journal.pdf
https://imt-atlantique.hal.science/hal-03265593v1
https://doi.org/10.1080/17445760.2021.1939873
https://imt-atlantique.hal.science/hal-03265593v1/document
https://dblp.uni-trier.de/db/journals/paapp/paapp36.html#AnceaumeBS21
https://hal-imt-atlantique.archives-ouvertes.fr/hal-03265593
https://hal-imt-atlantique.archives-ouvertes.fr/hal-03265593/document
https://www.tandfonline.com/doi/full/10.1080/17445760.2021.1939873

Estimating the Frequency of Data Items in Massive Distributed Streams

Authors: Anceaume, Emmanuelle Busnel, Yann Rivetti, Nicolò

Contributors: Anceaume, Emmanuelle Busnel, Yann Rivetti, Nicolò

Source: 2015 IEEE Fourth Symposium on Network Cloud Computing and Applications (NCCA). :59-66

Subject Terms: 13. Climate action, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, approximation theory, cloud computing, data handling, probability, CASE, approximation, cloud-based application, count-min sketch algorithm, data items, data streaming model, frequency estimation, large scale distributed data streams, massive distributed streams, probabilistic algorithms, values domain, Approximation algorithms, Approximation methods, Computational modeling, Computer aided software engineering, Data models, Estimation, Frequency estimation, Data stream model, randomized approximation algorithm, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, 7. Clean energy

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-01194529/file/NCCA2015.pdf
https://hal.science/hal-01194529v1
https://doi.org/10.1109/ncca.2015.19
https://hal.science/hal-01194529v1/document
https://hal.archives-ouvertes.fr/hal-01194529/document
http://hal.univ-nantes.fr/hal-01194529v1
http://ieeexplore.ieee.org/document/7340028/
https://ieeexplore.ieee.org/document/7340028/
http://hal.univ-nantes.fr/hal-01194529/document
https://hal-centralesupelec.archives-ouvertes.fr/hal-01286625v1
https://hdl.handle.net/11573/854244
https://doi.org/10.1109/NCCA.2015.19

Uniform node sampling service robust against collusions of malicious nodes

Authors: Anceaume, Emmanuelle Busnel, Yann Sericola, Bruno

Contributors: Anceaume, Emmanuelle Busnel, Yann Sericola, Bruno

Source: 2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). :1-12

Subject Terms: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Markov chains, randomized approximation algorithm, uniform sam- pling, Data stream, 0202 electrical engineering, electronic engineering, information engineering, strong adversary, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: application/pdf

Access URL: http://hal.univ-nantes.fr/docs/00/80/44/30/PDF/paper.pdf
https://hal.science/hal-00804430v1

An Information Divergence Estimation over Data Streams

Authors: Anceaume, Emmanuelle Busnel, Yann C.Elks

Contributors: Anceaume, Emmanuelle Busnel, Yann C.Elks

Source: 2012 IEEE 11th International Symposium on Network Computing and Applications. :28-35

Subject Terms: Data stream, Randomized approximation algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Divergence

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-00725097/file/papier.pdf
https://hal.science/hal-00725097v1
https://ieeexplore.ieee.org/document/6299123/
http://ieeexplore.ieee.org/document/6299123/
https://dblp.uni-trier.de/db/conf/nca/nca2012.html#AnceaumeB12
https://hal.archives-ouvertes.fr/hal-00725097
https://hal.archives-ouvertes.fr/hal-00725097/document

Computational experience with a SDP‐based algorithm for maximum cut with limited unbalance

Authors: Heilporn, Géraldine Labbé, Martine Marcotte, Patrice et al.

Contributors: Heilporn, Géraldine Labbé, Martine Marcotte, Patrice et al.

Source: Networks

Subject Terms: Combinatorial optimization, 1020 Informatik, 05 social sciences, network design, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, semidefinite programming, randomized approximation algorithm, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], 101015 Operations Research, Bilevel programming, AUT, 101015 Operations research, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Recherche opérationnelle, 1020 Computer Sciences, Network pricing

File Description: application/pdf; No full-text files; STAMPA

Access URL: http://www.optimization-online.org/DB_FILE/2008/01/1874.pdf
http://homepage.univie.ac.at/ivana.ljubic/research/publications/rlp.pdf
http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR-07-15.pdf
http://www2.ic.uff.br/~celso/artigos/bcpcp2.pdf
https://hal.science/hal-01255542v1
https://ucrisportal.univie.ac.at/de/publications/1a4418a1-a907-4039-a114-d3cb38b7cc74
https://www.ac.tuwien.ac.at/files/pub/hu-07.pdf
https://onlinelibrary.wiley.com/doi/10.1002/net.20370
https://dblp.uni-trier.de/db/journals/networks/networks55.html#HuLR10
https://www.ac.tuwien.ac.at/publications/hu-07?file=../../publications/ac-pub.bib
https://dl.acm.org/doi/10.5555/1780374.1780385
https://dl.acm.org/doi/10.5555/1780374.1780380
http://onlinelibrary.wiley.com/doi/10.1002/net.20364/abstract
https://dblp.uni-trier.de/db/journals/networks/networks55.html#LisserL10
https://www.euro-online.org/enog/inoc2007/Papers/author.24/paper/paper.24.pdf
https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.20369
https://dblp.uni-trier.de/db/journals/networks/networks55.html#GalbiatiGM10
https://re.public.polimi.it/handle/11311/570893
http://onlinelibrary.wiley.com/doi/10.1002/net.20372/full
https://dblp.uni-trier.de/db/journals/networks/networks55.html#GuoL10
http://www.euro-online.org/enog/inoc2007/Papers/author.116/paper/paper.116.pdf
https://dblp.uni-trier.de/db/journals/networks/networks55.html#ChenLR10
https://terpconnect.umd.edu/~raghavan/preprints/rlp.pdf
https://www.euro-online.org/enog/inoc2007/Papers/author.116/paper/paper.116.pdf
https://www.onlinelibrary.wiley.com/doi/abs/10.1002/net.20366
https://dblp.uni-trier.de/db/journals/networks/networks55.html#GordonJ10
https://onlinelibrary.wiley.com/doi/abs/10.1002/net.20363
https://webbox.lafayette.edu/~gordong/pubs/GordonJaeger.pdf
https://hdl.handle.net/11311/243826
https://hdl.handle.net/11311/570893

Approximation algorithms for maximum cut with limited unbalance

Authors: GALBIATI, GIULIA Francesco Maffioli Galbiati, Giulia et al.

Contributors: GALBIATI, GIULIA Francesco Maffioli Galbiati, Giulia et al.

Source: Theoretical Computer Science. 385:78-87

Subject Terms: SEMIDEFINITE PROGRAMMING, MAXIMUM CUT, General Computer Science, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, AUT, RANDOMIZED APPROXIMATION ALGORITHM, Randomized approximation algorithm, Maximum cut, Semidefinite programming, Limited unbalance cut, Computer Science(all)

File Description: STAMPA

Access URL: https://dblp.uni-trier.de/db/journals/tcs/tcs385.html#GalbiatiM07
https://dl.acm.org/citation.cfm?id=1290255
https://core.ac.uk/display/82092729
https://www.sciencedirect.com/science/article/pii/S0304397507004732
https://dlnext.acm.org/doi/10.1016/j.tcs.2007.05.036
https://dl.acm.org/doi/10.1016/j.tcs.2007.05.036
https://www.openaccessrepository.it/record/162326
https://hdl.handle.net/11311/552387

A Distributed Information Divergence Estimation over Data Streams

Authors: Anceaume, Emmanuelle Busnel, Yann CIDER et al.

Contributors: Anceaume, Emmanuelle Busnel, Yann CIDER et al.

Source: IEEE Transactions on Parallel and Distributed Systems. 25:478-487

Subject Terms: [INFO.INFO-DC]Computer Science [cs]/Distributed, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, E.0.a Data communications aspects < E.0 General < E Data, Parallel, Divergence, and Cluster Computing [cs.DC], Data stream, Randomized approximation algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, F.2.1 Numerical Algorithms and Problems < F.2 Analysis of Algorithms and Problem Complexity < F Theory of Computation

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-00998708/file/ankle-tpds2013.pdf
https://hal.science/hal-00998708v1/document
https://hal.science/hal-00998708v1
https://doi.org/10.1109/tpds.2013.101
https://dblp.uni-trier.de/db/journals/tpds/tpds25.html#AnceaumeB14
https://hal.archives-ouvertes.fr/hal-00998708
https://ieeexplore.ieee.org/document/6494567
https://hal.inria.fr/hal-00804437
https://hal.archives-ouvertes.fr/hal-00998708/document
http://dblp.uni-trier.de/db/journals/tpds/tpds25.html#AnceaumeB14

Sketch ⋆-Metric: Comparing Data Streams via Sketching

Authors: Anceaume, Emmanuelle Busnel, Yann Avresky, D.R. et al.

Contributors: Anceaume, Emmanuelle Busnel, Yann Avresky, D.R. et al.

Source: 2013 IEEE 12th International Symposium on Network Computing and Applications. :25-32

Subject Terms: [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], metric, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], randomized approximation algorithm, randomized approxima- tion algorithm, 01 natural sciences, Divergence, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], Data stream, Randomized approximation algorithm, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]

File Description: application/pdf

Access URL: http://arxiv.org/pdf/1207.6465.pdf
https://hal.science/hal-00764772v1
https://hal.science/hal-00721211v1
https://hal.science/hal-00721211v1/document

A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms

Authors: Maleq Khan V. S. Anil Kumar Gopal Pandurangan

Source: Theoretical Computer Science. 385:101-114

Subject Terms: Probabilistic analysis, Distributed algorithm, k-connected spanning subgraph, Randomized approximation algorithm, 0202 electrical engineering, electronic engineering, information engineering, 1. No poverty, Minimum spanning tree, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy, 3. Good health

Covering with Ellipses: Covering with ellipses

Authors: Efrat, Alon Hoffmann, Frank Knauer, Christian et al.

Source: Algorithmica. 38:145-160

Subject Terms: Proteomics, Data structures, Biochemistry, molecular biology, Randomized algorithms, Pattern recognition, speech recognition, 500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik, 0102 computer and information sciences, randomized approximation algorithm, Approximation algorithm, 01 natural sciences, Approximation algorithms, Computational geometry, Computer graphics, computational geometry (digital and algorithmic aspects), Algorithms and data structures, 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, 0101 mathematics, Set cover

File Description: application/xml

Access URL: https://refubium.fu-berlin.de/handle/fub188/19538

Efficiently Summarizing Data Streams over Sliding Windows

Authors: Rivetti, Nicoló Busnel, Yann Mostefaoui, Achour et al.

Contributors: Rivetti, Nicoló Busnel, Yann Mostefaoui, Achour et al.

Source: 2015 IEEE 14th International Symposium on Network Computing and Applications.

Subject Terms: 2. Zero hunger, [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], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], 02 engineering and technology, approximation theory, data handling, distributed processing, probability, approximation algorithm, distributed data stream summarization, frequency estimation, sliding window functional monitoring model, Approximation methods, Complexity theory, Computational modeling, Data models, Estimation, Frequency estimation, Monitoring, data stream, randomized approximation algorithm, windowing model

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-01535693/file/nca15.pdf
https://hal-univ-rennes1.archives-ouvertes.fr/hal-01535693
http://hal.univ-nantes.fr/hal-01535693v1
https://hal.archives-ouvertes.fr/hal-01535693
https://ieeexplore.ieee.org/document/7371718/
https://hal.archives-ouvertes.fr/hal-01535693/document
https://dblp.uni-trier.de/db/conf/nca/nca2015.html#RivettiBM15

PhD Proposal: Functional monitoring problem for distributed large-scale data streams

Authors: Emmanuelle Anceaume Yann Busnel Bruno Sericola et al.

Contributors: Emmanuelle Anceaume Yann Busnel Bruno Sericola et al.

Source: http://people.irisa.fr/Emmanuelle.Anceaume/PhD-datastream.pdf.

Subject Terms: Large-scale Data Stream, Randomized approximation algorithm, Functional monitoring problem, Byzantine Adversary, Performance Analysis

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.383.2171

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.383.2171
http://people.irisa.fr/Emmanuelle.Anceaume/PhD-datastream.pdf

Efficiently Summarizing Distributed Data Streams over Sliding Windows

Authors: Rivetti, Nicolò Busnel, Yann Mostefaoui, Achour et al.

Contributors: Rivetti, Nicolò Busnel, Yann Mostefaoui, Achour et al.

Source: https://hal.science/hal-01073877 ; [Research Report] LINA-University of Nantes; Centre de Recherche en Économie et Statistique; Inria Rennes Bretagne Atlantique. 2015, 19 p.

Subject Terms: Data stream, Windowing model, Frequency estimation, Randomized approximation algorithm, F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]

Availability: https://hal.science/hal-01073877
https://hal.science/hal-01073877v3/document
https://hal.science/hal-01073877v3/file/nca15-rr.pdf

Approximation Algorithms for Maximum Cut with Limited Unbalance

Authors: Giulia Galbiati Francesco Maffioli The Pennsylvania State University CiteSeerX Archives

Contributors: Giulia Galbiati Francesco Maffioli The Pennsylvania State University CiteSeerX Archives

Source: http://www.math.sci.kmitl.ac.th/seminar/msc/com/1-2550/49067512/Topic1/References/3.pdf.

Subject Terms: Randomized approximation algorithm, Semidefinite programming, Maximum cut, Limited

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.3304

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.3304
http://www.math.sci.kmitl.ac.th/seminar/msc/com/1-2550/49067512/Topic1/References/3.pdf

Sketch -metric: Comparing Data Streams via Sketching

Authors: Anceaume, Emmanuelle Busnel, Yann CIDER et al.

Contributors: Anceaume, Emmanuelle Busnel, Yann CIDER et al.

Source: Sketch ⋆-metric: Comparing Data Streams via Sketching ; The 12th IEEE International Symposium on Network Computing and Applications (IEEE NCA13) ; https://hal.science/hal-00764772 ; 2013, pp.8

Subject Terms: Data stream, metric, randomized approximation algorithm, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]

Subject Geographic: Boston, France

Time: Boston, France

Availability: https://hal.science/hal-00764772
https://hal.science/hal-00764772v1/document
https://hal.science/hal-00764772v1/file/AB13-PODS-RR2001.pdf

Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance

Authors: GALBIATI, GIULIA GUALANDI, STEFANO Francesco Maffioli et al.

Contributors: GALBIATI, GIULIA GUALANDI, STEFANO Francesco Maffioli et al.

Subject Terms: Network Design, Randomized Approximation Algorithm, Semidefinite Programming

File Description: ELETTRONICO

Relation: ispartofbook:Proceedings International Network Optimization Conference 2007; International Network Optimization Conference 2007 (INOC 2007); http://hdl.handle.net/11571/33968

Availability: http://hdl.handle.net/11571/33968

Computational Experience with a SDP-based Algorithm for Maximum Cut with Limited Unbalance

Authors: GALBIATI, GIULIA GUALANDI, STEFANO Francesco Maffioli et al.

Contributors: GALBIATI, GIULIA GUALANDI, STEFANO Francesco Maffioli et al.

Subject Terms: network design, randomized approximation algorithm, semidefinite programming

File Description: STAMPA

Relation: volume:55; issue:3; firstpage:247; lastpage:255; journal:NETWORKS; http://hdl.handle.net/11571/241697

Availability: http://hdl.handle.net/11571/241697

A Simple Randomized Scheme for Constructing Low-Weight k-Connected Spanning Subgraphs with Applications to Distributed Algorithms

Authors: Maleq Khan, Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Contributors: Maleq Khan, Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Source: http://staff.vbi.vt.edu/maleq/papers/TCS.pdf.

Subject Terms: Minimum Spanning Tree, Randomized Approximation Algorithm, Distributed Algorithm, Probabilistic Analysis

File Description: application/pdf

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.8975
http://staff.vbi.vt.edu/maleq/papers/TCS.pdf

A Simple Randomized Scheme for Constructing Low-Weight k-Connected Spanning Subgraphs with Applications to Distributed Algorithms

Authors: Maleq Khan, Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Contributors: Maleq Khan, Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Source: http://sites.google.com/site/gopalpandurangan/TCS_Final.pdf?attredirects=0.

Subject Terms: Minimum Spanning Tree, Randomized Approximation Algorithm, Distributed Algorithm, Probabilistic Analysis

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.4701; http://sites.google.com/site/gopalpandurangan/TCS_Final.pdf?attredirects=0

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.4701
http://sites.google.com/site/gopalpandurangan/TCS_Final.pdf?attredirects=0

A Simple Randomized Scheme for Constructing Low-Weight k-Connected Spanning Subgraphs with Applications to Distributed Algorithms

Authors: Maleq Khan, Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Contributors: Maleq Khan, Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.purdue.edu/homes/gopal/localmst.pdf.

Subject Terms: Minimum Spanning Tree, Randomized Approximation Algorithm, Distributed Algorithm, Probabilistic Analysis

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.5060; http://www.cs.purdue.edu/homes/gopal/localmst.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.5060
http://www.cs.purdue.edu/homes/gopal/localmst.pdf