Sciweavers

169 search results - page 34 / 34
» Counting paths in digraphs
Sort
View
CMOT
2004
141views more  CMOT 2004»
13 years 5 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
DAS
2010
Springer
13 years 3 months ago
Automatic unsupervised parameter selection for character segmentation
A major difficulty for designing a document image segmentation methodology is the proper value selection for all involved parameters. This is usually done after experimentations o...
Georgios Vamvakas, Nikolaos Stamatopoulos, Basilio...
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
12 years 27 days ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
SPAA
2010
ACM
13 years 10 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...