706 search results - page 98 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
PVLDB
2008
13 years 8 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
ISCAS
2008
IEEE
14 years 3 months ago
2008
IEEE
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
In object-based video, the encoding of the video data is decoupled into the encoding of shape, motion and texture information, which enables certain functionalities like content-b...
ASPDAC
2004
ACM
14 years 2 months ago
2004
ACM
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...