Sciweavers

552 search results - page 42 / 111
» Observable Graphs
Sort
View
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 2 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 1 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
DBSEC
2006
131views Database» more  DBSEC 2006»
13 years 9 months ago
Interactive Analysis of Attack Graphs Using Relational Queries
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
Lingyu Wang, Chao Yao, Anoop Singhal, Sushil Jajod...
IEEEPACT
2003
IEEE
14 years 1 months ago
Constraint Graph Analysis of Multithreaded Programs
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
Harold W. Cain, Mikko H. Lipasti, Ravi Nair
CORR
1999
Springer
164views Education» more  CORR 1999»
13 years 7 months ago
Annotation graphs as a framework for multidimensional linguistic data analysis
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
Steven Bird, Mark Liberman