Sciweavers

2063 search results - page 80 / 413
» connection 2007
Sort
View
NETWORKING
2007
15 years 12 days ago
The Token Based Switch: Per-Packet Access Authorisation to Optical Shortcuts
Abstract. Our Token Based Switch (TBS) implementation shows that a packetbased admission control system can be used to dynamically select a fast end-to-end connection over a hybrid...
Mihai-Lucian Cristea, Leon Gommans, Li Xu, Herbert...
COMBINATORICS
2007
85views more  COMBINATORICS 2007»
14 years 11 months ago
Maximum Cardinality 1-Restricted Simple 2-Matchings
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
David Hartvigsen
DAM
2007
94views more  DAM 2007»
14 years 11 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...
NETWORKING
2007
15 years 12 days ago
Graph Based Modeling of P2P Streaming Systems
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
BMCBI
2005
63views more  BMCBI 2005»
14 years 11 months ago
Communication and re-use of chemical information in bioscience
The current methods of publishing chemical information in bioscience articles are analysed. Using 3 papers as use-cases, it is shown that conventional methods using human procedur...
Peter Murray-Rust, John B. O. Mitchell, Henry S. R...