Sciweavers

2304 search results - page 182 / 461
» On the Vulnerability of Large Graphs
Sort
View
TKDE
2008
125views more  TKDE 2008»
15 years 6 months ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
SPAA
2004
ACM
15 years 12 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
SIGCOMM
1998
ACM
15 years 10 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
ANOR
2004
170views more  ANOR 2004»
15 years 6 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
16 years 1 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...