Sciweavers

ALGORITHMICA
2006
97views more  ALGORITHMICA 2006»
13 years 11 months ago
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and
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...
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
13 years 11 months ago
Efficient Algorithms for k Maximum Sums
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...
Fredrik Bengtsson, Jingsen Chen
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
13 years 11 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
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...
Geeta Chaudhry, Thomas H. Cormen
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
13 years 11 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
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...
ALGORITHMICA
2006
66views more  ALGORITHMICA 2006»
13 years 11 months ago
General Perfectly Periodic Scheduling
Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 11 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
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...
Jie Chi, Mehmet Koyutürk, Ananth Grama
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
13 years 11 months ago
Scalable Parallel Algorithms for FPT Problems
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 ...
ALGORITHMICA
2006
163views more  ALGORITHMICA 2006»
13 years 11 months ago
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
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...
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
13 years 11 months ago
Parallelizing Feature Selection
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...