Sciweavers

828 search results - page 81 / 166
» Simplicial Powers of Graphs
Sort
View
CCS
2009
ACM
14 years 2 months ago
Large-scale malware indexing using function-call graphs
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
Xin Hu, Tzi-cker Chiueh, Kang G. Shin
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
12 years 10 months ago
Graph cube: on warehousing and OLAP multidimensional networks
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
Peixiang Zhao, Xiaolei Li, Dong Xin, Jiawei Han
ICFP
2007
ACM
14 years 7 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
FM
2006
Springer
146views Formal Methods» more  FM 2006»
13 years 11 months ago
Formal Modeling of Communication Protocols by Graph Transformation
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
Zarrin Langari, Richard J. Trefler