Sciweavers

77 search results - page 4 / 16
» On the Spectrum of the Derangement Graph
Sort
View
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 5 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
CVIU
2008
113views more  CVIU 2008»
13 years 7 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...
ICPR
2006
IEEE
14 years 8 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
TWC
2008
145views more  TWC 2008»
13 years 6 months ago
Generalized Window-Based PN Acquisition Scheme in CDMA Spread Spectrum Systems
In this letter, we propose a generalized version of the window-based pseudonoise (PN) acquisition scheme verifying one or more best hypotheses rather than the best one per search w...
Kwang Man Ok, Chung Gu Kang
CVPR
2011
IEEE
13 years 3 months ago
Noise Resistant Graph Ranking for Improved Web Image Search
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
Wei Liu, Yu-Gang Jiang, Jiebo Luo, Shih-Fu Chang