3020 search results - page 73 / 604 » Optimal partition trees |
186
click to vote
SODA
2008
ACM
15 years 7 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 ...
131
click to vote
ICCAD
2008
IEEE
16 years 2 months ago
2008
IEEE
— In this paper, we present a partitioning, mapping, and routing optimization framework for energy-efficient VFI (Voltage-Frequency Island) based Network-on-Chip. Unlike the rece...
171
click to vote
ICIP
2002
IEEE
16 years 7 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...
161
click to vote
ICTAI
2009
IEEE
16 years 21 days 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...
167
click to vote
ISCAS
2005
IEEE
15 years 11 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 ...