42230 search results - page 390 / 8446 » Algorithms and Complexity Results for |
179
click to vote
DCC
1993
IEEE
15 years 11 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...
199
click to vote
ECAI
1992
Springer
15 years 11 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...
178
click to vote
CSR
2006
Springer
15 years 10 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...
167
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
241
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...