4714 search results - page 33 / 943 » The Complexity of Iterated Multiplication |
100
click to vote
TAMC
2009
Springer
15 years 2 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
DCC
1993
IEEE
15 years 1 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...
CSR
2006
Springer
15 years 1 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...
148
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
PCM
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we propose a robust text segmentation method in complex background. The proposed method first utilizes the K-means algorithm to decompose a detected text block into ...