Sciweavers

717 search results - page 108 / 144
» The Viewing Graph
Sort
View
OPODIS
2008
13 years 9 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
ICSE
2000
IEEE-ACM
13 years 11 months ago
Integrating UML diagrams for production control systems
This paper proposes to use SDL block diagrams, UML class diagrams, and UML behavior diagrams like collaboration diagrams, activity diagrams, and statecharts as a visual programmin...
Hans J. Köhler, Ulrich Nickel, Jörg Nier...
CRITIS
2007
13 years 9 months ago
An Analysis of Cyclical Interdependencies in Critical Infrastructures
Abstract In this paper we discuss the properties and algorithmic methods for the identification and classification of cyclical interdependencies in critical infrastructures based...
Nils Kalstad Svendsen, Stephen D. Wolthusen
RSA
2008
94views more  RSA 2008»
13 years 7 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
14 years 4 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar