Sciweavers

1188 search results - page 97 / 238
» Extended Graph Unification
Sort
View
JMLR
2008
120views more  JMLR 2008»
14 years 10 months ago
Causal Reasoning with Ancestral Graphs
Causal reasoning is primarily concerned with what would happen to a system under external interventions. In particular, we are often interested in predicting the probability distr...
Jiji Zhang
ENDM
2007
74views more  ENDM 2007»
14 years 10 months ago
The order of the largest complete minor in a random graph
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
Nikolaos Fountoulakis, Daniela Kühn, Deryk Os...
JGAA
2000
179views more  JGAA 2000»
14 years 10 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
TMM
2010
199views Management» more  TMM 2010»
14 years 4 months ago
Video Annotation Through Search and Graph Reinforcement Mining
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...
Emily Moxley, Tao Mei, Bangalore S. Manjunath
HPCC
2011
Springer
13 years 9 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé