Sciweavers

3359 search results - page 61 / 672
» A Simplified Idea Algorithm
Sort
View
DCC
2005
IEEE
14 years 9 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
DATESO
2007
103views Database» more  DATESO 2007»
13 years 11 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth
COR
2004
146views more  COR 2004»
13 years 10 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella
IPL
1998
177views more  IPL 1998»
13 years 9 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
13 years 7 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...
Haider Fakher Radhi Al-Saidy