Sciweavers

595 search results - page 43 / 119
» Incidence of
Sort
View
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
14 years 3 days ago
Maintaining a Minimum Spanning Tree Under Transient Node Failures
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
Enrico Nardelli, Guido Proietti, Peter Widmayer
BDIM
2008
IEEE
141views Business» more  BDIM 2008»
13 years 10 months ago
IT confidentiality risk assessment for an architecture-based approach
Information systems require awareness of risks and a good understanding of vulnerabilities and their exploitations. In this paper, we propose a novel approach for the systematic as...
Ayse Morali, Emmanuele Zambon, Sandro Etalle, Paul...
CCCG
2007
13 years 10 months ago
Pointed Drawings of Planar Graphs
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
Oswin Aichholzer, Günter Rote, André S...
ISSA
2008
13 years 10 months ago
A Collaborative Distributed Virtual Platform for Forensic Analysis of Malicious Code
Malicious software is prevalent in many forms with the potential for many types of malware to be downloaded while browsing the Internet using an unprotected system. The potential ...
Leonard Shand, Theodore Tryfonas
SCAI
2008
13 years 10 months ago
CBR for Advice Giving in a Data-Intensive Environment
Reusing past experiences by reasoning from past cases poses particular problems when the input to case retrieval comes from large amounts of online data. Volve has developed a syst...
Agnar Aamodt