Sciweavers

270 search results - page 20 / 54
» Matching graphs of Hypercubes and Complete Bipartite Graphs
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 8 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
GLOBECOM
2008
IEEE
13 years 9 months ago
Cooperative Spectrum Allocation in Centralized Cognitive Networks Using Bipartite Matching
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
Chengshi Zhao, Mingrui Zou, Bin Shen, Bumjung Kim,...
MM
2010
ACM
151views Multimedia» more  MM 2010»
13 years 8 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...
IJCM
2002
83views more  IJCM 2002»
13 years 8 months ago
A Radio Coloring of a Hypercube
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
Ophir Frieder, Frank Harary, Peng-Jun Wan
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 3 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan