Sciweavers

7886 search results - page 49 / 1578
» An evaluation of bipartitioning techniques
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 9 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
ICDM
2009
IEEE
202views Data Mining» more  ICDM 2009»
13 years 7 months ago
Link Prediction on Evolving Data Using Matrix and Tensor Factorizations
Abstract--The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In t...
Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda
FGR
2011
IEEE
354views Biometrics» more  FGR 2011»
13 years 20 days ago
Hierarchical ranking of facial attributes
Abstract— We propose a novel hierarchical structured prediction approach for ranking images of faces based on attributes. We view ranking as a bipartite graph matching problem; l...
Ankur Datta, Rogerio Feris, Daniel A. Vaquero
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 4 months ago
Ranking hubs and authorities using matrix functions
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
Michele Benzi, Ernesto Estrada, Christine Klymko
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan