Sciweavers

729 search results - page 75 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 5 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 3 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 2 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
IWDC
2001
Springer
145views Communications» more  IWDC 2001»
14 years 2 months ago
Activating and Deactivating Repair Servers in Active Multicast Trees
Abstract. For time-constrained applications, repair-server-based active local recovery approaches can be valuable in providing low-latency reliable multicast service. However, an a...
Ping Ji, James F. Kurose, Donald F. Towsley
FC
1997
Springer
86views Cryptology» more  FC 1997»
14 years 2 months ago
The SPEED Cipher
Abstract. SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext/ciphertext of SPEED can be 64, 128 or 256 bits. ...
Yuliang Zheng