Sciweavers

7886 search results - page 3 / 1578
» An evaluation of bipartitioning techniques
Sort
View
ORDER
2008
91views more  ORDER 2008»
13 years 9 months ago
Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
Manfred Droste, Robert Gray, John K. Truss
MTA
2010
175views more  MTA 2010»
13 years 7 months ago
Automatic summarization of rushes video using bipartite graphs
In this paper we present a new approach for automatic summarization of rushes video. Our approach is composed of three main steps. First, based on a temporal segmentation, we filte...
Liang Bai, Yan-Li Hu, Songyang Lao, Alan F. Smeato...
ICCAD
1997
IEEE
83views Hardware» more  ICCAD 1997»
14 years 1 months ago
Replication for logic bipartitioning
Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a b...
Morgan Enos, Scott Hauck, Majid Sarrafzadeh
PVLDB
2008
116views more  PVLDB 2008»
13 years 8 months ago
Anonymizing bipartite graph data using safe groupings
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z...
DM
2006
103views more  DM 2006»
13 years 9 months ago
Bounds on the forcing numbers of bipartite graphs
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...
Seth Kleinerman