distance computation
A Fast K-prototypes Algorithm Using Partial Distance Computation
... avoids distance computations using partial distance ...minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time ...
8
Edit distance computation with minimum number of edit operations in database management system and information retrieval
... Levenshtein distance is a string metric for measuring the difference between two ...Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or ...
6
Use of GPU and Feature Reduction for Fast Query by Example Spoken Term Detection
... For query-by-example spoken term de- tection (QbE-STD) on low resource lan- guages, variants of dynamic time warp- ing techniques (DTW) are used. How- ever, DTW-based techniques are slow and thus a limitation to search ...
7
Content Based Fingerprinting for Video Copyright Detection System
... method distance measure performs much better than other distance for duplicate detection for shorter ...This distance computation procedure, also end up computing which model vector serves as ...
5
Security and Efficiency Analysis of The Hamming Distance Computation Protocol Based On Oblivious Transfer
... the computation of the Hamming distance of two binary biometric ...Hamming distance does not reveal any significant information to any polynomially bounded ...Hamming distance ...
10
Well-organized Estimation of Range Aggregates against Uncertain Location-Based Queries
... of distance between uncertain ...accurate distance computation between uncertain objects is important to many uncertain query evaluation ...involve distance computations between samples of two ...
7
History Reuse Architecture: Reuse of Historical Computations across Iterations of a Converging Algorithm.
... reusing distance computation ...of distance per iteration by reusing the precalculated distance bounds with changes in the limit of the distances maintained in history on a per iteration ...
55
Big Data Analytic of Nigeria Population Census Data using MapReduce and K Means Algorithm
... the distance computation between one object ‘a’ and the center is independent of the distance computation between another object 'b' and the center of the ...the distance measures of ...
8
SHADE: Secure HAmming DistancE computation from oblivious transfer
... Secure Computation of weighted Hamming distance has already been consid- ered in [2, 3] using homomorphic encryption and garbled ...the computation of both nu- merator and denominator in the weighted ...
20
A Review-Architecture for Matching of Data Encoded with Hard Systematic Error Correcting Code Using FPGA for Low Complexity and Low Latency
... The proposed architecture grounded on the data path design is shown in Fig. 5. It contains multiple butterfly-formed weight accumulators (BWAs) proposed to improve the latency and complexity of the Hamming ...
6
Enhanced computation method of topological smoothing on shared memory parallel machines
... enhanced computation method for smoothing 2D object in binary ...parallel computation and better memory management, while preserving the topology (number of connected components) of the original image by ...
17
Reducing computation complexity of the image segmentation algorithm based on ESFCM
... the computation complexity analysis of the original algorithm above, the physical distance between an edge pixel with every clustering center is the main reason for the heavy computation ...fuzzy ...
6
FPGA Design and Implementation of a Convolutional Encoder and a Viterbi Decoder Based on 802 11a for OFDM
... In this paper, a modified FPGA scheme for the convolutional encoder and Viterbi decoder based on the IEEE 802.11a standards of WLAN is presented in OFDM baseband processing systems. The proposed design supports a ...
7
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem
... In order to solve TSP, GA has the advantages in finding a feasible solution in a very short time if the data that used is small or moderate. It can quickly scan a vast solution set. But, if the data that used is large, ...
12
Fast phylogenetic inference from typing data
... given distance, used for untying links according to the total order discussed in the description of goeBURST algorithm in methods section, and a second time for enumerating pairs at dis- tance below a given ...the ...
14
Homomorphic Computation of Edit Distance
... secure computation of the minimum distance (Hamming distance and Euclidean ...for computation of multiple Hamming distance values using the LNV scheme [17], so that they could find the ...
16
Assessment of Economic Capital: An Equity Market approach
... Bank’s distance to default (DD) measures the difference between the estimated market value of the assets (MVA) and the book value of total liabilities (BVL), scaled by the standard deviation of the assets’ market ...
7
Faster Privacy-Preserving Location Proximity Schemes
... clidean distance-based Privacy-Preserving Location Proximity (PPLP) schemes (i) using a mix of Secure Two-Party Computation (STPC) protocols, (ii) us- ing DGK encryption [DGK09] and Bloom filters [Blo70], ...
23
#9 pdf
... Algorithm 8.1 is easy to implement in almost any programming language. However, this section contains a short guide to some readily available implementations of this algorithm and its variants for those who would rather ...
11
Efficient and Faster Method for QueryDependent Local Landmark Scheme
... shortest distance between queried node is ...shortest distance between two queried ...then distance among these two queried nodes is calculated as sum of their shortest distance to local ...
5