Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...
Roberto Maria Avanzi, Clemens Heuberger, Helmut Pr...
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likel...
Thomas M. Keane, Andrew J. Page, Thomas J. Naughto...
Classification is a key problem in machine learning/data mining. Algorithms for classification have the ability to predict the class of a new instance after having been trained on...
Jerffeson Teixeira de Souza, Stan Matwin, Nathalie...