For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...

here a posteriori error estimate for the numerical solution of nonlinear voltena- hammerstein equations is given. we present an error upper bound for nonlinear voltena-hammastein integral equations, in which the form of nonlinearity is algebraic and develop a posteriori error estimate for the recently proposed method of brunner for these problems (the implicitly linear collocation method).we al...

The propositional-Calculus (C) is a powerful propositional program logic with xpoints. C decidability with exponential upper bound was sketched for the rst time in 1988 by E. A. Emerson and Ch. S. Jutla on base of automata-theoretic technique, while a complete proof was published in 1999 only. Meanwhile M. Vardi sketched in 1998 an automata-theoretic proof of exponential decidability for the pr...

The paper proposes a technique for speeding up the search of the optimal set of features in classification problems where the input variables are discrete or nominal. The approach is based on the definition of an upper bound on the mutual information between the target and a set of d input variables. This bound is derived as a function of the mutual information of its subsets of d − 1 cardinali...

Decision feedback sequence estimation (DFSE) is a reduced state alternative to maximum likelihood sequence estimation (MLSE). One of the most popular technique to improve the performance of DFSE is to process the received signal by a linear pre-filter prior to DFSE. This technique is referred to as combinedlinear DFSE (CLDFSE). In this paper, we derive a tight upper bound on the error performan...

We develop a path cover technique to solve lowest common ancestor (LCA for short) problems in a directed acyclic graph (dag). Our method yields improved upper bounds for two recently studied problem variants, computing one (representative) LCA for all pairs of vertices and computing all LCAs for all pairs of vertices. The bounds are expressed in terms of the number n of vertices and the so call...

This paper introduces an efficient technique to compute a tight upper bound for the unate and binate covering problems. It is known that a covering problem can be solved by finding a shortest path on a BDD representing a satisfiability formula. Our technique is based on finding an approximation to the shortest path by identifying a path on a BDD composed of as many negative edges as possible. T...

We consider two generic problems of combinatorial search under the additive model. The rst one is the problem of reconstructing boundeddweight vectors. We establish an optimal upper bound and observe that it uniies many known results for coinnweighing problems. The developed technique provides a basis for the graph reconstruction problem. Optimal upper bound is proven for the class of kdegenera...

Caire, Taricco and Biglieri presented a detailed analysis of bit interleaved coded modulation, a simple and popular technique used to improve system performance, especially in the context of fading channels. They derived an upper bound to the probability of error, called the expurgated bound. In this correspondence, the proof of the expurgated bound is shown to be flawed. A new upper bound is a...