Sciweavers

7913 search results - page 106 / 1583
» Information Collection on a Graph
Sort
View
DAM
2010
60views more  DAM 2010»
13 years 9 months ago
One-to-many node-disjoint paths in (n, k)-star graphs
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
Yonghong Xiang, Iain A. Stewart
PCI
2005
Springer
14 years 2 months ago
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
Stavros D. Nikolopoulos, Leonidas Palios
TMA
2010
Springer
206views Management» more  TMA 2010»
14 years 3 months ago
Collection and Exploration of Large Data Monitoring Sets Using Bitmap Databases
Collecting and exploring monitoring data is becoming increasingly challenging as networks become larger and faster. Solutions based on both SQL-databases and specialized binary for...
Luca Deri, Valeria Lorenzetti, Steve Mortimer
IEEEARES
2007
IEEE
14 years 3 months ago
Collection of Quantitative Data on Security Incidents
Quantitative data about security threats is a precondition for a precise assessment of security risks and consequently for an efficient management of information security. Curren...
Thomas Nowey, Hannes Federrath
NPIV
1999
ACM
153views Visualization» more  NPIV 1999»
14 years 1 months ago
Exploration of Large Image Collections Using Virtual Reality Devices
An image browser for the exploration of image collections is described. The approach taken is to utilize VR input devices to develop more intuitive interaction metaphors that allo...
Robert van Liere, Wim C. de Leeuw