Sciweavers

1154 search results - page 118 / 231
» On the editing distance of graphs
Sort
View
DAGSTUHL
2006
13 years 11 months ago
Vertex reconstruction in Cayley graphs
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
Elena V. Konstantinova
ECCV
2004
Springer
14 years 12 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
JNSM
2008
93views more  JNSM 2008»
13 years 10 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
JGT
2006
98views more  JGT 2006»
13 years 10 months ago
Group chromatic number of planar graphs of girth at least 4
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
Hong-Jian Lai, Xiangwen Li
JPDC
2007
138views more  JPDC 2007»
13 years 10 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki