706 search results - page 68 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
JUCS
2007
13 years 7 months ago
2007
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
COMBINATORICA
2008
13 years 7 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Packet Classification (PC) has been a critical data path function for many emerging networking applications. An interesting approach is the use of TCAM to achieve deterministic, hi...
SIGCOMM
2005
ACM
14 years 1 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
COMCOM
2006
13 years 7 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...