Sciweavers

TC
2008
13 years 9 months ago
Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
Majid Khabbazian, Vijay K. Bhargava
TC
2008
13 years 9 months ago
Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = P
V. S. Dimitrov, Kimmo U. Järvinen, M. J. Jaco...
IM
2007
13 years 9 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
TASLP
2008
175views more  TASLP 2008»
13 years 9 months ago
A Variable Step-Size Affine Projection Algorithm Designed for Acoustic Echo Cancellation
Abstract--The adaptive algorithms used for acoustic echo cancellation (AEC) have to provide 1) high convergence rates and good tracking capabilities, since the acoustic environment...
Constantin Paleologu, Jacob Benesty, Silviu Ciochi...
TASLP
2008
108views more  TASLP 2008»
13 years 9 months ago
An Online Relevant Set Algorithm for Statistical Machine Translation
This paper presents a novel online relevant set algorithm for a linearly-scored block sequence translation model. The key component is a new procedure to directly optimize the glob...
Christoph Tillmann, Tong Zhang
ANOR
2005
93views more  ANOR 2005»
13 years 9 months ago
Evolutionary Approaches to DNA Sequencing with Errors
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...
Jacek Blazewicz, Fred Glover, Marta Kasprzak
AMC
2005
138views more  AMC 2005»
13 years 9 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
AMC
2005
146views more  AMC 2005»
13 years 9 months ago
A functional language to implement the divide-and-conquer Delaunay triangulation algorithm
This paper investigates the implementation of a functional language algorithm for the divide-and-conquer Delaunay triangulation. The global aim is to improve its performance. Up t...
André L. Moura, José R. Camacho, Seb...
AMC
2005
127views more  AMC 2005»
13 years 9 months ago
Option valuation by using discrete singular convolution
This paper explores the utility of a discrete singular convolution (DSC) algorithm for solving the Black
Shan Zhao, G. W. Wei
IJON
2007
98views more  IJON 2007»
13 years 9 months ago
Convergent design of piecewise linear neural networks
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...
Hema Chandrasekaran, Jiang Li, W. H. Delashmit, Pr...