Sciweavers

125 search results - page 25 / 25
» The Complexity of Rooted Phylogeny problems
Sort
View
LISA
1994
13 years 6 months ago
The Group Administration Shell and the GASH Network Computing Environment
Managing large scale UNIX networks so that users can use resources on multiple systems is traditionally performed using NIS, NFS, and DNS. Proper use of these tools requires exact...
Jonathan Abbey
CN
2007
117views more  CN 2007»
13 years 5 months ago
Cellular universal IP for nested network mobility
In recent years, network mobility (NEMO) has been studied extensively due to its potential applications in military and public transportation. NEMO basic support protocol (NBSP), ...
Patrick P. Lam, Soung C. Liew, Jack Y. B. Lee
DAM
2007
107views more  DAM 2007»
13 years 5 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
CCR
2005
131views more  CCR 2005»
13 years 5 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...
TASLP
2002
67views more  TASLP 2002»
13 years 5 months ago
Efficient tracking of the cross-correlation coefficient
In many (audio) processing algorithms, involving manipulation of discrete-time signals, the performance can vary strongly over the repertoire that is used. This may be the case whe...
Ronald M. Aarts, Roy Irwan, Augustus J. E. M. Jans...