Sciweavers

100 search results - page 15 / 20
» Closure and factor-critical graphs
Sort
View
ICICS
2005
Springer
14 years 27 days ago
Network Vulnerability Analysis Through Vulnerability Take-Grant Model (VTG)
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
Hamid Reza Shahriari, Reza Sadoddin, Rasool Jalili...
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
13 years 8 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
CVPR
2006
IEEE
14 years 1 months ago
Globally Optimal Grouping for Symmetric Boundaries
Many natural and man-made structures have a boundary that shows certain level of bilateral symmetry, a property that has been used to solve many computer-vision tasks. In this pap...
Joachim S. Stahl, Song Wang
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
14 years 1 months ago
Efficient Closed Contour Extraction from Range Image's Edge Points
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
Angel Domingo Sappa
VLDB
1990
ACM
77views Database» more  VLDB 1990»
13 years 11 months ago
Efficient Main Memory Data Management Using the DBGraph Storage Model
Therequirementsfor amain memorydatastoragemodel are both compactnessand efficient processing for all database operations. The DBGraph storage model, proposed in this paper, achiev...
Philippe Pucheral, Jean-Marc Thévenin, Patr...