Sciweavers

614 search results - page 64 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
ICASSP
2009
IEEE
15 years 4 months ago
Semi-definite programming approach to sensor network node localization with anchor position uncertainty
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
Kenneth Wing-Kin Lui, Wing-Kin Ma, Hing-Cheung So,...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 3 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
AAAI
2008
15 years 8 days ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
ICC
2007
IEEE
153views Communications» more  ICC 2007»
15 years 4 months ago
A Walking Beacon-Assisted Localization in Wireless Sensor Networks
—The localization of the sensor node is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can a...
Bin Xiao, Hekang Chen, Shuigeng Zhou