Sciweavers

1986 search results - page 295 / 398
» Path Separability of Graphs
Sort
View
IDA
2010
Springer
15 years 1 months ago
Selecting the Links in BisoNets Generated from Document Collections
According to Koestler, the notion of a bisociation denotes a connection between pieces of information from habitually separated domains or categories. In this paper, we consider a ...
Marc Segond, Christian Borgelt
KBSE
2010
IEEE
15 years 1 months ago
Analyzing security architectures
We present a semi-automated approach, Secoria, for analyzing a security runtime architecture for security and for conformance to an object-oriented implementation. Typecheckable a...
Marwan Abi-Antoun, Jeffrey M. Barnes
FAST
2009
15 years 1 months ago
Story Book: An Efficient Extensible Provenance Framework
Most application provenance systems are hard coded for a particular type of system or data, while current provenance file systems maintain in-memory provenance graphs and reside i...
Richard P. Spillane, Russell Sears, Chaitanya Yala...
JSYML
2011
108views more  JSYML 2011»
14 years 10 months ago
Analytic equivalence relations and bi-embeddability
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
Sy-David Friedman, Luca Motto Ros
169
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
Network-aware behavior clustering of Internet end hosts
Abstract—This paper explores the behavior similarity of Internet end hosts in the same network prefixes. We use bipartite graphs to model network traffic, and then construct on...
Kuai Xu, Feng Wang 0002, Lin Gu