10988 search results - page 130 / 2198 » Algorithmic Folding Complexity |
140
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
131
Voted
AAIM
2006
Springer
15 years 8 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
121
click to vote
DCC
1993
IEEE
15 years 6 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
137
Voted
ECAI
1992
Springer
15 years 6 months ago
1992
Springer
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
126
Voted
CSR
2006
Springer
15 years 6 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...