We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false, for every δ > 0 there exists a constant ε > 0 such that computing a (1 + ε)-approximation to the Bichromatic Closest Pair requires Ω (

The work presented in this paper focuses on recognition of isolated handwritten characters in Devanagari and Gurumukhi script. The proposed work uses four feature extraction methods like Zoning density, Projection histograms, Distance profiles and Background Directional Distribution(BDD). On the basis of these four types of features we have formed 10 feature vectors using different combinations...

We consider the generalized minimum Manhattan network problem (GMMN). The input to this problem is a set R of n pairs of terminals, which are points in R. The goal is to find a minimum-length rectilinear network that connects every pair in R by a Manhattan path, that is, a path of axis-parallel line segments whose total length equals the pair’s Manhattan distance. This problem is a generalizati...

Nearest neighbor is pattern matching method for time series prediction in which most recent values of the time series are compared with previous available values and forecasting is achieved by finding the best match pattern (nearest neighbor). Usually Euclidean distance is used to check the similarity of pattern. In this paper two hybrid criteria of pattern matching are being proposed and evalu...

In this article we define a procedure which corrects an incoherent probability assessment on a finite domain by exploiting a geometric property of L1-distance (known also as Manhattan distance) and mixed integer programming. L1-distance minimization does not produce, in general, a unique solution but rather a corrected assessment that could result an imprecise probability model. We propose a co...

The evolution of today's application technologies requires a certain level of robustness, reliability and ease of integration. We choose the Fields Programmable Gate Array (FPGA) hardware description language to implement the facial recognition algorithm based on "Eigen faces" using Principal Component Analysis. In this paper, we first present an overview of the PCA used for facial recognition,...

Bibit padi yang mempunyai kualitas unggul memiliki peran penting dalam peningkatan produktivitas pada sektor pertanian. Banyaknya bibit dikembangkan oleh Balai Besar Penelitian Tanaman Padi menghasilkan karakteristik baru serta kemiripan hampir sama. berdasarkan karakteristiknya dapat dikelompokkan dengan menggunakan metode Clustering dimana proses perhitungannya pengukuran jarak. Pada peneliti...

An e-scooter trip model is estimated from four U.S. cities: Portland, Austin, Chicago and New York City. A log–log regression for trips based on user age, population, land area, the number of scooters. The predicts 75 K daily in Manhattan a deployment 2000 scooters, which translates to 77 million USD annual revenue. We propose novel nonlinear, multifactor break down by alternative modes transpo...

The aim of this study is to analyse dynamic programming in large scale, complex networks is more important in the fields of scientific and engineering. Recent applications needs the analysis of scale-free networks with many millions of nodes and edges; presenting a huge computational challenge. Employing distributed networks on-chip infrastructure presents a unique opportunity of delivering pow...