Sciweavers

202 search results - page 3 / 41
» A New Measure for the Bandwidth Minimization Problem
Sort
View
INFOCOM
1999
IEEE
13 years 11 months ago
Resource Allocation in a Multicast Tree
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...
Murali S. Kodialam, Steven H. Low
ADHOCNOW
2005
Springer
14 years 28 days ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 22 days ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
EMMCVPR
1999
Springer
13 years 11 months ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
INFOCOM
2012
IEEE
11 years 9 months ago
Delay optimal multichannel opportunistic access
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
Shiyao Chen, Lang Tong, Qing Zhao