Sciweavers

1532 search results - page 65 / 307
» Connection Relations in Mereotopology
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Pricing under Constraints in Access Networks: Revenue Maximization and Congestion Management
Abstract—This paper investigates pricing of Internet connectivity services in the context of a monopoly ISP selling broadband access to consumers. We first study the optimal com...
Prashanth Hande, Mung Chiang, A. Robert Calderbank...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
CVGIP
2002
126views more  CVGIP 2002»
14 years 9 months ago
Dual Mesh Resampling
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...
Gabriel Taubin
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
14 years 9 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
MASS
2010
173views Communications» more  MASS 2010»
14 years 8 months ago
Efficient routing in delay tolerant networks with correlated node mobility
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
Eyuphan Bulut, Sahin Cem Geyik, Boleslaw K. Szyman...