Sciweavers

468 search results - page 26 / 94
» One-Way Functions in Complexity Theory
Sort
View
76
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
14 years 11 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
CODES
2007
IEEE
15 years 5 months ago
Complex task activation schemes in system level performance analysis
The design and analysis of today’s complex real-time systems requires advanced methods. Due to ever growing functionality, hardware complexity and component interaction, applyin...
Wolfgang Haid, Lothar Thiele
79
Voted
CCS
2007
ACM
15 years 5 months ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin
TSMC
2010
14 years 5 months ago
Contrasting Views of Complexity and Their Implications For Network-Centric Infrastructures
There exists a widely recognized need to better understand and manage complex "systems of systems," ranging from biology, ecology, and medicine to network-centric technol...
David L. Alderson, John C. Doyle
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 11 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari