Sciweavers

1469 search results - page 23 / 294
» Characterizing the Structural Complexity of Real-World Compl...
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 7 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
JMLR
2006
118views more  JMLR 2006»
13 years 7 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
BMCBI
2010
183views more  BMCBI 2010»
13 years 7 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
INFOCOM
2003
IEEE
14 years 24 days ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan
AAAI
2010
13 years 9 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos