Sciweavers

368 search results - page 15 / 74
» Higher Eigenvalues of Graphs
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
Albert Y. C. Chen, Jason J. Corso, Le Wang
CVPR
2008
IEEE
14 years 9 months ago
Exact inference in multi-label CRFs with higher order cliques
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
Srikumar Ramalingam, Pushmeet Kohli, Karteek Alaha...
GPEM
2008
116views more  GPEM 2008»
13 years 7 months ago
An Eigen analysis of the GP community
The coauthorship and coeditorship relations as recorded in the genetic programming bibliography provide a quantitative view of the GP community. Eigen analysis is used to find the ...
William B. Langdon, Riccardo Poli, Wolfgang Banzha...
PKDD
2005
Springer
155views Data Mining» more  PKDD 2005»
14 years 1 months ago
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
ISPAN
2005
IEEE
14 years 1 months ago
The structure of super line graphs
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...
Jay Bagga, Daniela Ferrero