1986 search results - page 318 / 398 » Path Separability of Graphs |
IPPS
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper describes improvements to the Mach microkernel’s support for efficient application startup across multiple nodes in a cluster or massively parallel processor. Signifi...
RT
1995
Springer
13 years 11 months ago
1995
Springer
We describe a new framework for efficiently computing and storing global illumination effects for complex, animated environments. The new framework allows the rapid generation of ...
CONEXT
2005
ACM
13 years 9 months ago
2005
ACM
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
CONEXT
2008
ACM
13 years 9 months ago
2008
ACM
The Locator/Identifier Separation Protocol (LISP) is one of the candidate solutions to address the scalability issues in inter-domain routing. The current proposals for its contro...