Sciweavers

296 search results - page 34 / 60
» Bipartite Graphs as Models of Complex Networks
Sort
View
UAI
2004
15 years 1 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
16 years 3 days ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
SAC
2005
ACM
15 years 5 months ago
Graphical rule-based representation of signal-transduction networks
The process by which a cell senses and responds to its environment, as in signal transduction, is often mediated by a network of protein-protein interactions, in which proteins co...
James R. Faeder, Michael L. Blinov, William S. Hla...
INFOCOM
2012
IEEE
13 years 2 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
ESWS
2006
Springer
15 years 3 months ago
Semantic Network Analysis of Ontologies
A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools...
Bettina Hoser, Andreas Hotho, Robert Jäschke,...