The search session has expired. Please query the service again.
Displaying 761 –
780 of
4977
In this paper, a batch arrival general bulk service queueing system with interrupted
vacation (secondary job) is considered. At a service completion epoch, if the server finds
at least ‘a’ customers waiting for service say ξ, he
serves a batch of min (ξ, b) customers, where
b ≥ a. On the other hand, if the queue length is at
the most ‘a-1’, the server leaves for a secondary job (vacation) of
random length. It is assumed that the secondary...
The traveling salesman problem (TSP) is one of the most fundamental optimization problems. We consider the β-metric traveling salesman problem (Δβ-TSP), i.e., the TSP restricted to graphs satisfying the β-triangle inequality c({v,w}) ≤ β(c({v,u}) + c({u,w})), for some cost function c and any three vertices u,v,w. The well-known path matching Christofides algorithm (PMCA) guarantees an approximation ratio of 3β2/2 and is the best known algorithm for the Δβ-TSP, for 1 ≤ β ≤ 2. We provide a complete...
We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.
Dimension reduction is an important topic in data mining and machine learning. Especially dimension reduction combined with feature fusion is an effective preprocessing step when the data are described by multiple feature sets. Canonical Correlation Analysis (CCA) and Discriminative Canonical Correlation Analysis (DCCA) are feature fusion methods based on correlation. However, they are different in that DCCA is a supervised method utilizing class label information, while CCA is an unsupervised method....
This paper studies the gradient flow of a regularized Mumford-Shah functional proposed by Ambrosio and Tortorelli (1990, 1992) for image segmentation, and adopted by Esedoglu and Shen (2002) for image inpainting. It is shown that the gradient flow with initial data possesses a global weak solution, and it has a unique global in time strong solution, which has at most finite number of point singularities in the space-time, when the initial data are in . A family of fully discrete approximation...
This paper studies the gradient flow of a regularized Mumford-Shah functional
proposed by Ambrosio and Tortorelli (1990, 1992) for image
segmentation, and adopted by Esedoglu and Shen (2002) for image inpainting.
It is shown that the gradient flow with L2 x L∞ initial data
possesses a global weak solution, and it has a unique global in time
strong solution, which has at most finite number of point singularities
in the space-time, when the initial data are in H1 x H1 ∩ L∞.
A family of fully...
We analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis is then refined to obtain a canonical path analysis. The construction of the flow and of the canonical paths is based on related path constructions in a paper of Cordovil and Moreira (1993) on block matroids. The estimates of the congestion measure imply a polynomial bound on the mixing time. The canonical paths for spanning trees also yield polynomial...
March tests are widely used in the process of RAM testing. This family of tests is very efficient in the case of simple faults such as stuck-at or transition faults. In the case of a complex fault model-such as pattern sensitive faults-their efficiency is not sufficient. Therefore we have to use other techniques to increase fault coverage for complex faults. Multibackground memory testing is one of such techniques. In this case a selected March test is run many times. Each time it is run with new...
The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetic trees and give some basic properties of the Matching Split metric, which...
Currently displaying 761 –
780 of
4977