Sciweavers

2542 search results - page 132 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 7 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
APNOMS
2006
Springer
15 years 7 months ago
"P4L": A Four Layers P2P Model for Optimizing Resources Discovery and Localization
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
Mourad Amad, Ahmed Meddahi
ICIP
2003
IEEE
16 years 4 months ago
Prescient R-D optimized packet dependency management for low-latency video streaming
We present an improved, prescient, scheme to deliver pre-encoded video streams at very low latency. We dynamically manage the prediction dependency for a group of packets using a ...
Yi J. Liang, Bernd Girod
RTSS
2007
IEEE
15 years 9 months ago
Optimal Discrete Rate Adaptation for Distributed Real-Time Systems
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
Yingming Chen, Chenyang Lu, Xenofon D. Koutsoukos
ATAL
2003
Springer
15 years 8 months ago
Multiagent diffusion and distributed optimization
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Kwok Ching Tsui, Jiming Liu