Sciweavers

397 search results - page 69 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
COMPGEOM
2005
ACM
13 years 10 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 10 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
ICC
2007
IEEE
218views Communications» more  ICC 2007»
14 years 3 months ago
Utility-Based Resource Allocation for Layer-Encoded IPTV Multicast in IEEE 802.16 (WiMAX) Wireless Networks
In this paper, we propose a utility-based resource allocation scheme for layer-encoded IPTV multicast streaming service over IEEE 802.16 WiMAX networks. Unlike existing utility-bas...
Wen-Hsing Kuo, Tehuang Liu, Wanjiun Liao
TALG
2008
124views more  TALG 2008»
13 years 8 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic