Sciweavers

1248 search results - page 41 / 250
» On the Number of Birch Partitions
Sort
View
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
13 years 10 months ago
Scalable Name Disambiguation using Multi-level Graph Partition
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
Byung-Won On, Dongwon Lee
JDA
2008
94views more  JDA 2008»
13 years 8 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
14 years 9 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
14 years 2 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»
14 years 1 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...