123,157 Hits in 8.5 sec

Low-Complexity Maximum-Likelihood Estimator for Clock Synchronization of Wireless Sensor Nodes Under Exponential Delays

Mei Leng, Yik-Chung Wu
2011 IEEE Transactions on Signal Processing  
And in the interior-point method, the complexity is with denoting the total number of bits in a binary representation of the coefficients in the LP problem [25] , [26] .  ...  Note that and are the time stamps recorded by the clock of node R, while and are recorded by that of node C. After rounds of message exchange, node C obtains a set of time stamps .  ... 
doi:10.1109/tsp.2011.2160857 fatcat:6r3ry3j5wvhu5hnhnakdt4ugx4

Communication complexity and data compression

U. Tamm
2013 2013 Information Theory and Applications Workshop (ITA)  
A result of Ahlswede and Cai for the 2-party communication complexity of set intersection is generalized to a multiparty model.  ...  The compression for set intersection also was helpful in the study of several more functions.  ...  The research in [25] was motivated by a recent extension of the direct-sum conjecture to the "number in hand" model of multiparty communication complexity [11] .  ... 
doi:10.1109/ita.2013.6502978 dblp:conf/ita/Tamm13a fatcat:n5ozduopi5h3reyh6gilobfvx4

Some problems in distributed computational geometry

Sergio Rajsbaum, Jorge Urrutia
2011 Theoretical Computer Science  
We prove that the message complexity of leader election in a geometric ring is Ω(n log n), hence geometric information does not help in reducing the message complexity of this problem.  ...  We also study the classic distributed computing problem of leader election, to understand the impact that geometric information has on the message complexity of solving it.  ...  The second author was supported by SEP-CONACYT of México, Proyecto 80268. For further reading [17]  ... 
doi:10.1016/j.tcs.2011.06.035 fatcat:hbp6j2tcczb2xktwfjgyhopb2e

Kikuchi approximation method for joint decoding of LDPC codes and partial-response channels

P. Pakzad, V. Anantharam
2006 IEEE Transactions on Communications  
In this letter, we apply the Kikuchi approximation method to the problem of joint decoding of a low-density parity-check code and a partial-response channel.  ...  We will first review the Kikuchi approximation method and the generalized BP algorithm, which is an iterative message-passing algorithm based on this method.  ...  Therefore, each iteration of the GBP algorithm entails about as many message updates as the standard BP, although GBP update rules of (9) are admittedly more complex than those of the BP.  ... 
doi:10.1109/tcomm.2006.877944 fatcat:krlotuvwanfkxnmhisludzaaqi

Privacy-preserving Judgment of the Intersection for Convex Polygons

Yifei Yao, Shurong Ning, Miaomiao Tian, Wei Yang
2012 Journal of Computers  
As the basic issues of computational geometry, intersection and union of convex polygons can solve lots of problems, such as economy and military affairs.  ...  At last, the security, complexity and applicability analysis of the protocols are also discussed.  ...  ACKNOWLEDGMENT The authors wish to thank Professor L. Huang, for providing excellent notes of the discussion.  ... 
doi:10.4304/jcp.7.9.2224-2231 fatcat:kuqgmwb7sbdpjh3bnttnpkml3e

Distributed Computation of the Cech Complex and Applications in Wireless Networks [article]

Ngoc-Khuyen Le , Laurent Decreusefond
2016 arXiv   pre-print
Two applications based on the distributed computation of thě Cech complex are proposed. The first application detects coverage holes while the later one optimizes coverage of wireless networks.  ...  In this paper, we introduce a distributed algorithm to compute thě Cech complex. This algorithm is aimed at solving coverage problems in self organized wireless networks.  ...  The Rips complex is an approximation of thě Cech complex. The Rips complex represents a collection of cells by a simplex if every pair of cells in this collection are intersected.  ... 
arXiv:1612.03694v1 fatcat:qejbp4r32rhlpf5r4hftdbtmce


2012 International Journal of Foundations of Computer Science  
In these protocols, after receiving a broadcast message, each node that is requested to relay the message instructs a subset of its 1-hop neighbors, a.k.a. the forwarding set, to further relay it.  ...  The concept of forwarding sets is widely adopted in many broadcast protocols for wireless multihop networks to alleviate the broadcast storm problem.  ...  The problem of a minimum local disk cover set is formally stated as follows: PROBLEM 1 Minimum Local Disk Cover Set (MLDCS) Problems Input: Let V = {u 0 , u 1, ..., u n } be a set of disk centers.  ... 
doi:10.1142/s0129054112500165 fatcat:gslafadianb2lixt2to5oeqtiq

Privacy-Preserving Quantum Two-Party Geometric Intersection

Wenjie Liu, Yong Xu, James C. N. Yang, Wenbin Yu, Lianhua Chi
2019 Computers Materials & Continua  
[Qin, Duan, Zhao et al. (2014) ] proposed the Lagrange multiplier method to solve the intersection of the two private curves, and this method is suitable for solving general geometry intersection problems  ...  The above problem is a typical application of privacypreserving geometric intersection (PGI). Different from the protocols based on circuit evaluation schemes, recently Qin et al.  ...  Acknowledgement: The authors would like to thank the anonymous reviewers and editors for their comments that improved the quality of this paper. This work is supported by the Nature Science  ... 
doi:10.32604/cmc.2019.03551 fatcat:g5dlnchnjfcpba37rtzwgtfjpe

Distributed Mutual Exclusion Algorithms for Intersection Traffic Problems

Harisu Abdullahi Shehu, Md. Haidar Sharif, Rabie A. Ramadan.
2020 IEEE Access  
In other words, the message complexity of CENDI [30] is as high as O(n 2 ), where n represents the number of vehicles at a particular intersection.  ...  The algorithm of EMEV [35] solved the problem by setting the traffic light of the lane in which an emergency vehicle was detected to green.  ...  The authors also thank to the anonymous reviewers for their appreciative and constructive comments on the draft of this paper.  ... 
doi:10.1109/access.2020.3012573 fatcat:bm335ayggvhczllteeo6ckyd7m

Beyond set disjointness

Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev
2014 Proceedings of the 2014 ACM symposium on Principles of distributed computing - PODC '14  
Computing the intersection is at least as hard as the set disjointness problem, which asks whether the intersection is empty. Formally, in the two-server setting, the players hold subsets S, T ⊆ [n].  ...  We study the minimum number of bits the parties need to communicate in order to compute the intersection set S ∩ T , given a certain number r of messages that are allowed to be exchanged.  ...  One of the most well-studied problems in communication complexity is the disjointness function DISJ n k (S, T ).  ... 
doi:10.1145/2611462.2611501 dblp:conf/podc/BrodyCKWY14 fatcat:dqbpumli7zhrpeukx2lbm7y5qm

Superlinear Lower Bounds for Multipass Graph Processing

Venkatesan Guruswami, Krzysztof Onak
2013 2013 IEEE Conference on Computational Complexity  
The task of the players is to find out whether the sets of vertices at distance exactly p + 1 from a specific vertex intersect.  ...  These streaming results follow from a communication complexity lower bound for a communication game in which the players hold two graphs on the same set of vertices.  ...  to the intersection of two resulting sets in INTERSECT(SC n,p ).  ... 
doi:10.1109/ccc.2013.37 dblp:conf/coco/GuruswamiO13 fatcat:pplp7uc7ozg2zdgxqcl3m7kkna

A General Framework for Intersection Traffic Control with Backpressure Routing

Sen Bai, Xin Bai
2021 IEEE Access  
Besides, a maximum weight independent set (MWIS) based approach is proposed to minimize the average waiting time of vehicles at an isolated intersection.  ...  Through an in-depth examination of their basic models, we find that the two-fold ideal assumptions are largely compelled by the surprisingly high complexity of converting a practical intersection topology  ...  MWIS-BASED ISOLATED INTERSECTION CONTROL A basic problem in intersection control is how to find the sets of concurrent lanes.  ... 
doi:10.1109/access.2021.3096827 fatcat:eew42hgsrnbbtbfv3ipzfb4vdq

Superlinear Lower Bounds for Multipass Graph Processing

Venkatesan Guruswami, Krzysztof Onak
2016 Algorithmica  
The task of the players is to find out whether the sets of vertices at distance exactly p + 1 from a specific vertex intersect.  ...  These streaming results follow from a communication complexity lower bound for a communication game in which the players hold two graphs on the same set of vertices.  ...  to the intersection of two resulting sets in INTERSECT(SC n,p ).  ... 
doi:10.1007/s00453-016-0138-7 fatcat:6tcciz62cbgepbw6qoxfzmfeh4

PAIM: Platoon-based Autonomous Intersection Management [article]

Masoud Bashiri, Hassan Jafarzadeh, Cody Fleming
2018 arXiv   pre-print
Autonomous Intersection Management (AIM), also known as Cooperative Intersection Management (CIM) is among the more challenging traffic problems that poses important questions related to safety and optimization  ...  A simulator software is designed to compare the results of the proposed policy in terms of average delay per vehicle and variance in delay with that of a 4-phase traffic light.  ...  Computational Complexity The algorithm considers all permutations of the set of platoons, including possible non-conflicting trajectories in which case simultaneous crossing is considered.  ... 
arXiv:1809.06956v1 fatcat:hebihsxrgfgpdcsac2kjcry7aq

A Decentralised Approach to Intersection Traffic Management

Huan Vu, Samir Aknine, Sarvapali D. Ramchurn
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
Traffic congestion has a significant impact on quality of life and the economy.  ...  Our solution outperforms the state of the art solution both for stable traffic conditions (about 60% reduced waiting time) and robustness to unpredictable events.  ...  Let t be the current time step and V t the set of all vehicles approaching the intersection.  ... 
doi:10.24963/ijcai.2018/73 dblp:conf/ijcai/VuAR18 fatcat:3kxbypoz2vawpnlahfacp26tgy
« Previous Showing results 1 — 15 out of 123,157 results