Sciweavers

352 search results - page 39 / 71
» Fast Graph Pattern Matching
Sort
View
ICIP
2003
IEEE
14 years 9 months ago
Fast indexing for image retrieval based on local appearance with re-ranking
This paper describes an approach to retrieve images containing specific objects, scenes or buildings. The image content is captured by a set of local features. More precisely, we ...
Hao Shao, Tomás Svoboda, Vittorio Ferrari, ...
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
14 years 1 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
SAC
2008
ACM
13 years 7 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
ICIP
2007
IEEE
14 years 9 months ago
Unsupervised Modeling of Object Tracks for Fast Anomaly Detection
A key goal of far-field activity analysis is to learn the usual pattern of activity in a scene and to detect statistically anomalous behavior. We propose a method for unsupervised...
Tomas Izo, W. Eric L. Grimson
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
13 years 9 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri