Sciweavers

286 search results - page 28 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
ICMLA
2008
15 years 3 months ago
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
CIKM
2009
Springer
15 years 8 months ago
Graph classification based on pattern co-occurrence
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
Ning Jin, Calvin Young, Wei Wang
CIARP
2005
Springer
15 years 7 months ago
Dynamic Hierarchical Compact Clustering Algorithm
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
Reynaldo Gil-García, José Manuel Bad...
ECCV
2010
Springer
15 years 7 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
WCRE
1993
IEEE
15 years 6 months ago
Flexible Control for Program Recognition
Recognizing commonly used data structures and algorithms is a key activity in reverse engineering. Systems developed to automate this recognition process have been isolated, stand...
Linda M. Wills