Sciweavers

66 search results - page 10 / 14
» Network design with weighted degree constraints
Sort
View
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
ISCAS
2002
IEEE
94views Hardware» more  ISCAS 2002»
14 years 14 days ago
Video transport over ad-hoc networks using multiple paths
Enabling video transport over ad-hoc networks is more challenging than over other wireless networks because a connection path in an ad-hoc network is highly error-prone and a path...
Shunan Lin, Yao Wang, Shiwen Mao, Shivendra S. Pan...
OA
1989
237views Algorithms» more  OA 1989»
13 years 11 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
TVCG
2008
96views more  TVCG 2008»
13 years 7 months ago
Hand Motion Prediction for Distributed Virtual Environments
We use our hands to manipulate objects in our daily life. The hand is capable of accomplishing diverse tasks such as pointing, gripping, twisting, and tearing. However, there is no...
Addison Chan, Rynson W. H. Lau, Lewis W. F. Li
INFOCOM
2008
IEEE
14 years 1 months ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano