Sciweavers

736 search results - page 47 / 148
» Approximating the Number of Network Motifs
Sort
View
MSWIM
2005
ACM
15 years 3 months ago
Content and service replication strategies in multi-hop wireless mesh networks
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...
Shudong Jin, Limin Wang
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 4 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
INFOCOM
2006
IEEE
15 years 3 months ago
Adaptive Admission Control Algorithm for Multiuser OFDMA Wireless Networks
—We propose a new adaptive admission control scheme for multiuser OFDMA systems to allocate wireless resource with low complexity. In this adaptive admission control scheme, the ...
Kyung-Ho Sohn, Jongkyung Kim, Tae Sung Kim, Young ...
COMPUTING
2010
14 years 7 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
CCCG
2010
14 years 11 months ago
3d local algorithm for dominating sets of unit disk graphs
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...