We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored p...

Weerahandi (1995b) suggested a generalization of the Fisher’s solution of the Behrens-Fisher problem to the problem of multiple comparisons with unequal variances by the method of generalized p-values. In this paper, we present a brief outline of the Fisher’s solution and its generalization as well as the methods to calculate the p-values required for deriving the conservative joint confidence ...

Second generation wavelet based super resolution algorithms developed in this research are presented in this paper. Generalization of the Second generation wavelet super resolution (SGWSR) algorithm to handle arbitrarily irregular 2-D grids as opposed to the semi-regular grids handled in the previous algorithm is introduced. A consequence is the ability to incorporate the projective camera moti...

A method for the simultaneous co-registration and georeferencing of multiple 3D pointclouds and associated intensity information is proposed. It is a generalization of the 3D surface matching problem. The simultaneous co-registration provides for a strict solution to the problem, as opposed to sequential pairwise registration. The problem is formulated as the Least Squares matching of overlappi...

In this paper, we study the generalization performance of regularized multi-task learning (RMTL) in a vector-valued framework, where MTL is considered as a learning process for vector-valued functions. We are mainly concerned with two theoretical questions: 1) under what conditions does RMTL perform better with a smaller task sample size than STL? 2) under what conditions is RMTL generalizable ...

We present simultaneous reduction algorithms for two (nonsymmetric) matrices A and B to upper Hessenberg and lower Hessenberg forms, respectively. One is through the simultaneous similarity reduction and the other is through a Lanczos– Arnoldi-type iteration. The algorithm that uses the Lanczos–Arnoldi-type iteration can be considered as a generalization of both the nonsymmetric Lanczos algorit...

We use a generalization of the Rosenbluth separation method for model independent simultaneous extraction Compton Form Factors H and E, from virtual scattering data on an unpolarized target. A precise evaluation enabled by proposed method, is first step towards pinning down distribution angular momentum inside proton.

We characterize disjoint hypercyclic and supercyclic tuples of unilateral Rolewicz-type operators on $c_0(\N)$ $\ell^p(\N)$, $p \in [1, \infty)$, which are a generalization the backward shift operator. show that hypercyclicity supercyclicity equivalent among subfamily these always satisfy Disjoint Hypercyclicity Criterion. also simultaneous \infty)$.