455 search results - page 29 / 91 » On Trees and Noncrossing Partitions |
INFOCOM
2002
IEEE
14 years 22 days ago
2002
IEEE
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
Reliable transmission of video over wireless networks must address the limited bandwidth and the possibility of loss. When the bandwidth is insufficient on a single channel, the v...
ICTAI
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...