Sciweavers

1206 search results - page 162 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 10 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...
FM
2006
Springer
146views Formal Methods» more  FM 2006»
14 years 13 days 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
COMSWARE
2008
IEEE
13 years 10 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
SIGKDD
2008
125views more  SIGKDD 2008»
13 years 8 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun