Sciweavers

1133 search results - page 174 / 227
» Basics of Graph Cuts
Sort
View
CANDC
2006
ACM
13 years 10 months ago
Identification of functional modules in a PPI network by clique percolation clustering
Large-scale experiments and data integration have provided the opportunity to systematically analyze and comprehensively understand the topology of biological networks and biochem...
Shi-Hua Zhang, Xue-Mei Ning, Xiang-Sun Zhang
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
13 years 9 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
JAIR
2010
145views more  JAIR 2010»
13 years 8 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 1 months ago
Data Base Mappings and Theory of Sketches
In this paper we will present the two basic operations for database schemas used in database mapping systems (separation and Data Federation), and we will explain why the functoria...
Zoran Majkic
INFOCOM
2009
IEEE
14 years 4 months ago
Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...