Sciweavers

4962 search results - page 164 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
WG
2001
Springer
15 years 10 months ago
(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele D...
ICMCS
2000
IEEE
80views Multimedia» more  ICMCS 2000»
15 years 10 months ago
LDA+: A TCP-Friendly Adaptation Scheme for Multimedia Communication
— In this paper, we present an end-to-end adaptation scheme, called the enhanced loss-delay based adaptation algorithm (LDA+), for regulating the transmission behavior of multime...
Dorgham Sisalem, Adam Wolisz
DMTCS
2010
125views Mathematics» more  DMTCS 2010»
15 years 3 months ago
Binary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
Stefan Felsner, Clemens Huemer, Sarah Kappes, Davi...
NCA
2003
IEEE
15 years 11 months ago
AdHocFS: Sharing Files in WLANs
This paper presents the ADHOCFS file system for mobile users, which realizes transparent, adaptive file access according to the users’ specific situations (e.g., device in us...
Malika Boulkenafed, Valérie Issarny
JCO
2008
134views more  JCO 2008»
15 years 6 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...