7913 search results - page 467 / 1583 » Information Collection on a Graph |
130
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
133
click to vote
ICMCS
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
141
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
154
click to vote
WICON
2008
15 years 6 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
135
Voted
SODA
2001
ACM
15 years 6 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...