Sciweavers

2197 search results - page 68 / 440
» Sampling community structure
Sort
View
NETWORKS
2008
13 years 10 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
CVIU
2011
13 years 5 months ago
Sampled medial loci for 3D shape representation
The medial axis transform is valuable for shape representation as it is complete and captures part structure. However, its exact computation for arbitrary 3D models is not feasibl...
Svetlana Stolpner, Sue Whitesides, Kaleem Siddiqi
JMLR
2012
12 years 13 days ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 4 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
13 years 7 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas