Sciweavers

620 search results - page 51 / 124
» The edge-flipping group of a graph
Sort
View
GLOBECOM
2006
IEEE
14 years 3 months ago
Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
GBRPR
2005
Springer
14 years 2 months ago
Coarse-to-Fine Object Recognition Using Shock Graphs
Shock graphs have emerged as a powerful generic 2-D shape representation. However, most approaches typically assume that the silhouette has been correctly segmented. In this paper,...
Aurelie Bataille, Sven J. Dickinson
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
MSR
2005
ACM
14 years 2 months ago
Mining version histories to verify the learning process of Legitimate Peripheral Participants
Since code revisions reflect the extent of human involvement in the software development process, revision histories reveal the interactions and interfaces between developers and...
Shih-Kun Huang, Kang-min Liu
VIZSEC
2007
Springer
14 years 3 months ago
An Interactive Attack Graph Cascade and Reachability Display
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
Leevar Williams, Richard Lippmann, Kyle Ingols