14 search results - page 2 / 3 » Recent Progress and Prospects for Integer Factorisation Algo... |
COMPLIFE
2005
Springer
13 years 11 months ago
2005
Springer
During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignmen...
INFORMS
1998
13 years 5 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
SAGT
2010
Springer
13 years 4 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
DCC
2000
IEEE
13 years 10 months ago
2000
IEEE
This paper contains two contributions to very-low-bitrate video coding. First, we show that in contrast to common practice incremental techniques for rate-distortion optimization ...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...