570 search results - page 10 / 114 » On the number of zero-sum subsequences |
ARITH
2005
IEEE
14 years 3 months ago
2005
IEEE
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
IPCO
2007
13 years 11 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
IEEESCC
2009
IEEE
13 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
SPIRE
2010
Springer
13 years 8 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
SWAT
2010
Springer
14 years 2 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...