517 search results - page 8 / 104 » Near-Deterministic Inference of AS Relationships |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships fr...
DAGSTUHL
2004
14 years 11 months ago
2004
This paper describes a novel intellectual structure for the subject space of material designed for selective autodidactic learning in a large knowledge base. This structure is base...
ICHIT
2009
Springer
15 years 4 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
102
click to vote
KDD
2012
ACM
13 years 16 days ago
2012
ACM
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...