Sciweavers

286 search results - page 30 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
CIKM
2009
Springer
15 years 8 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
WG
1993
Springer
15 years 6 months ago
Dually Chordal Graphs
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
Andreas Brandstädt, Feodor F. Dragan, Victor ...
PR
2010
145views more  PR 2010»
15 years 10 days ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen
153
Voted
IVC
2007
173views more  IVC 2007»
15 years 1 months ago
Outdoor recognition at a distance by fusing gait and face
We explore the possibility of using both face and gait in enhancing human recognition at a distance performance in outdoor conditions. Although the individual performance of gait ...
Zongyi Liu, Sudeep Sarkar
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 2 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...