Sciweavers

54 search results - page 7 / 11
» Forcing highly connected subgraphs
Sort
View
RECOMB
2006
Springer
15 years 9 months ago
Identification and Evaluation of Functional Modules in Gene Co-expression Networks
Abstract. Identifying gene functional modules is an important step towards elucidating gene functions at a global scale. In this paper, we introduce a simple method to construct ge...
Jianhua Ruan, Weixiong Zhang
SAC
2003
ACM
15 years 2 months ago
Image Retrieval With Embedded Region Relationships
Image retrieval based on content from digital libraries, multimedia databases, the Internet, and other sources has been an important problem addressed by several researchers. In t...
Sharat Chandran, Naga Kiran
CMOT
2004
141views more  CMOT 2004»
14 years 9 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
OMER
2001
14 years 10 months ago
Implementing Function Block Adapters
: Function Block Adapters (FBAs) are new modeling elements, responsible for the connection of UML capsules and function blocks of the IEC 61131-3 standard. FBAs contain an interfac...
Torsten Heverhagen, Rudolf Tracht
ICALP
2001
Springer
15 years 1 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan