Search results for "Communication complexity"

showing 2 items of 12 documents

Performance comparison of residual related algorithms for ToA positioning in wireless terrestrial and sensor networks

2009

©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." Article also available from publisher: http://dx.doi.org/10.1109/WIRELESSVITAE.2009.5172462 Time of Arrival (ToA) is a popular technique for terrestrial positioning. This paper presents a comparison of ToA based residual related positioning algorithms in wireless terrestrial and sensor networks in both long range outdoor and short range indoor environments. Us…

Time of arrivalComputational complexity theoryComputer scienceIterative methodbusiness.industryVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552WirelessResidualCommunication complexitybusinessWireless sensor networkAlgorithmWeighting
researchProduct

Upper bounds on multiparty communication complexity of shifts

1996

We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e ) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].

TheoryofComputation_MISCELLANEOUSDiscrete mathematicsCombinatoricsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYCommunication complexityBinary logarithmBoolean functionUpper and lower boundsMultiparty communicationMathematics
researchProduct