Sciweavers

641 search results - page 90 / 129
» Collusion set detection using graph clustering
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 1 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
CVIU
2008
192views more  CVIU 2008»
13 years 8 months ago
Content based video matching using spatiotemporal volumes
This paper presents a novel framework for matching video sequences using the spatiotemporal segmentation of videos. Instead of using appearance features for region correspondence ...
Arslan Basharat, Yun Zhai, Mubarak Shah
ACMSE
2006
ACM
14 years 2 months ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
14 years 1 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
PLDI
2010
ACM
14 years 6 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer