14518 search results - page 11 / 2904 » Two Problems for Sophistication |
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
QUESTA
2002
13 years 7 months ago
2002
Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary ...
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
SP
1996
IEEE
13 years 11 months ago
1996
IEEE
Recently, two major bankcard payment instrument operators VISA and MasterCard published speci cations for securing bankcard payment transactions on open networks for open scrutiny...