Sciweavers

151 search results - page 4 / 31
» Optimal (2, n) visual cryptographic schemes
Sort
View
ICPP
2003
IEEE
14 years 19 days ago
A Priority-based Balanced Routing Scheme for Random Broadcasting and Routing in Tori
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Abdelhami...
INFOCOM
2005
IEEE
14 years 29 days ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
LATIN
2010
Springer
14 years 2 months ago
Optimal Succinctness for Range Minimum Queries
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
Johannes Fischer
INFOCOM
2010
IEEE
13 years 5 months ago
An Optimal Key Distribution Scheme for Secure Multicast Group Communication
Abstract— Many IP multicast-based applications, such as multimedia conferencing, multiplayer games, require controlling the group memberships of senders and receivers. One common...
Zhibin Zhou, Dijiang Huang
ICDCN
2009
Springer
14 years 2 months ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman