1 - 10 of 11 articles
In this paper we consider the zero error variable length coding problem for discrete memoryless sources with side information at the decoder only. Using concepts of graph theory, we obtain a characterization of the minimum achievable rater for this coding problem. Furthermore, computable upper...
In this paper, we give a best possible Ore-like condition for a graph so that its line graph is pancyclic or vertex pancyclic.
Given a simple bipartite graphG=(X,Y, E).M
$$ \subseteq $$
E is called a 2-1 matching ofG if: 1) ∀
εX, either two edges or none inM is incident tox and 2) ∀
εY, at most one edge inM is incident toy. In this paper, we describe an efficient algorithm for finding a maximum 2-1 matching in...
The connectivity and the circuit rank of a graphG are denoted byx(G) andρ, respectively. It is shown that ifH is the adjacent tree graph of a simple connected graphG, thenx(H)=2ρ.
This paper discusses BEM for Stationary Stokes problem in three dimensions, studies its convergence and superconvergence, and gives the optimal error estimates as well.
In this paper, we consider different types of Markov models for random fields, namely, causal-type (nonsymmetrical half-plane) models, causal-type (quadrant) models, semicausal-type (half-plane) models and noncausal-type models. Theorems are proved to give the spectral characterization of these...
We point out a mistake in  in the proof of infinite propagation of the weak solution of Cauchy problem for the equationu
- φ(u). A more natural condition is given and the infinite propagation property for boundary value problem is studied. Finally, we discuss the supports of the...
This paper investigates the generalized least squares estimation and the maximum likelihood estimation of the parameters in a multivariate polychoric correlations model, based on data from a multidimensional contingency table. Asymptotic properties of the estimators are discussed. An iterative...
In this paper, some distribution in the family of those with invariance under orthogonal transformations within ans-dimensional linear subspace are characterized by maximun likelihood criteria. Specially, the main result is: supposeP
is a projection matrix of a givens-dimensional subspaceV,...
The optimum point of an unknown function which is measured with noise and the unknown parameters in the measurement noise are estimated by a combined algorithm. The almost sure convergence and the convergence rate are established for both unconstrained and constrained problems.
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.