2430 search results - page 184 / 486 » Computing Tutte Polynomials |
196
click to vote
QOSIP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
191
click to vote
VLSM
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. In this paper we propose a novel variational technique for the knowledge based segmentation of two dimensional objects. One of the elements of our approach is the use of ...
194
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
211
click to vote
STACS
1994
Springer
15 years 11 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
258
click to vote
ARITH
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...