Sciweavers

1756 search results - page 167 / 352
» Directed scale-free graphs
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 8 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 3 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
CIBCB
2007
IEEE
14 years 2 months ago
Spectral Decomposition of Signaling Networks
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
Bahram Parvin, Nirmalya Ghosh, Laura Heiser, Merri...
ISMAR
2006
IEEE
14 years 2 months ago
Interactive context-driven visualization tools for augmented reality
In this article we present an interaction tool, based on the Magic Lenses technique, that allows a 3D scene to be affected dynamically given contextual information, for example, t...
Erick Méndez, Denis Kalkofen, Dieter Schmal...