706 search results - page 130 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
CCR
2004
13 years 7 months ago
2004
Today, most multi-connected autonomous systems (AS) need to control the flow of their interdomain traffic for both performance and economical reasons. This is usually done by manu...
JACM
2008
13 years 7 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
How to adaptively choose optimal neighborhoods is very important to pixel-domain image denoising algorithms since too many neighborhoods may cause over-smooth artifacts and too fe...