459 search results - page 24 / 92 » Detecting induced subgraphs |
CORR
2012
Springer
12 years 4 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
ACL
2000
13 years 9 months ago
2000
An approach to automatic detection of syllable structure is presented. We demonstrate a novel application of EM-based clustering to multivariate data, exempli ed by the induction ...
191
click to vote
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
DAM
2010
13 years 8 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...