Sciweavers

436 search results - page 31 / 88
» Recursion and Complexity
Sort
View
VIZSEC
2004
Springer
14 years 1 months ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 2 months ago
Enumerating randoms
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...
Bjørn Kjos-Hanssen, Frank Stephan, Jason Te...
SLOGICA
2008
99views more  SLOGICA 2008»
13 years 6 months ago
Decidable Cases of First-order Temporal Logic with Functions
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
Walter Hussak
CAGD
2007
77views more  CAGD 2007»
13 years 7 months ago
A geometric diagram and hybrid scheme for triangle subdivision
We introduce a geometrical diagram to study the improvement in shape of triangles generated by iterative application of triangle subdivision. The four Triangles Longest Edge (4TLE...
Angel Plaza, José P. Suárez, Graham ...
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann