706 search results - page 120 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
EMSOFT
2010
Springer
13 years 6 months ago
2010
Springer
Many safety-critical embedded systems are subject to certification requirements. However, only a subset of the functionality of the system may be safety-critical and hence subject...
INFOCOM
1999
IEEE
14 years 1 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
ASPDAC
2007
ACM
14 years 24 days ago
2007
ACM
- For modern processor designs in nanometer technologies, both block and interconnect pipelining are needed to achieve multi-gigahertz clock frequency, but previous approaches cons...
CGF
2008
13 years 9 months ago
2008
Typically, flow volumes are visualized by defining their boundary as iso-surface of a level set function. Grid-based level sets offer a good global representation but suffer from ...
COMPGEOM
2007
ACM
14 years 22 days ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...