Sciweavers

125 search results - page 3 / 25
» An Experimental Analysis of a Compact Graph Representation
Sort
View
ICANN
2007
Springer
13 years 11 months ago
Recursive Principal Component Analysis of Graphs
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...
Alessio Micheli, Alessandro Sperduti
ICPR
2008
IEEE
14 years 6 months ago
Multiclass spectral clustering based on discriminant analysis
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
Xi Li, Zhongfei Zhang, Yanguo Wang, Weiming Hu
ICPR
2010
IEEE
13 years 10 months ago
Face Recognition Using a Multi-Manifold Discriminant Analysis Method
—In this paper, we propose a Multi-Manifold Discriminant Analysis (MMDA) method for face feature extraction and face recognition, which is based on graph embedded learning and un...
Wankou Yang, Changyin Sun, Lei Zhang
CVPR
2010
IEEE
13 years 7 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ICSE
2004
IEEE-ACM
14 years 5 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury