Sciweavers

1346 search results - page 53 / 270
» On the number of rectangular partitions
Sort
View
JDA
2008
94views more  JDA 2008»
14 years 9 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
ICPR
2004
IEEE
15 years 11 months ago
Multiresolution Spatial Partitioning for Shape Representation
In this paper, an original solution for shape representation is proposed which relies on a spatial partitioning approach. The representation selects a discrete set of reference po...
Stefano Berretti, Alberto Del Bimbo
RTAS
2006
IEEE
15 years 3 months ago
Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
Sathish Gopalakrishnan, Marco Caccamo
ASPDAC
1999
ACM
100views Hardware» more  ASPDAC 1999»
15 years 2 months ago
A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition
: This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into sub...
Kai Zhang, Tsuyoshi Shinogi, Haruhiko Takase, Teru...
ISSS
1998
IEEE
107views Hardware» more  ISSS 1998»
15 years 2 months ago
Integrating Communication Protocol Selection with Partitioning in Hardware/Software Codesign
This paper presents a codesign approach which incorporates communication protocol selection as a design parameter within hardware/software partitioning. The presented approach tak...
Peter Voigt Knudsen, Jan Madsen