Distributed convex thresholding

DOI10.1145/2767386.2767387MaRDI QIDQ2796269zbMATH OpenOpenAlexFDO

Authors Ran Wolff

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2767386.2767387

zbMATH Keywords

wireless sensor networkslocal algorithmspeer-to-peer systemscommunication-efficient algorithmsgeometric monitoring

Mathematics Subject Classification ID

Convex programming (90C25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Fully Distributed Algorithms for Convex Optimization Problems
• Efficient threshold detection in a distributed environment (extended abstract)
• Monitoring threshold functions over distributed data streams with node dependent constraints
• Algorithms for distributed functional monitoring
• Fully distributed algorithms for convex optimization problems

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(2)

• Efficient decentralized algorithms for the distributed trigger counting problem
• Efficient threshold detection in a distributed environment (extended abstract)

This page was built for publication: Distributed convex thresholding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796269)