Sciweavers

1736 search results - page 99 / 348
» On antimagic directed graphs
Sort
View
ISSTA
2009
ACM
14 years 5 months ago
Identifying bug signatures using discriminative graph mining
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 4 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
IPMI
2007
Springer
14 years 11 months ago
Comparing Pairwise and Simultaneous Joint Registrations of Decorrelating Interval Exams Using Entropic Graphs
The interest in registering a set of images has quickly risen in the field of medical image analysis. Mutual information (MI) based methods are well-established for pairwise regist...
Bing Ma, Ramkrishnan Narayanan, Hyunjin Park, Alfr...
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
14 years 11 months ago
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
Bin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, ...
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
14 years 4 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader