Results 1  10
of
60,075
Count onetoone correspondence
, 2007
"... More than one rater needed Training Raters need to know the student population, even the content experts Practice rating and capture rules Plan for double coding ~ 20% Check agreement during the process ..."
Abstract
 Add to MetaCart
More than one rater needed Training Raters need to know the student population, even the content experts Practice rating and capture rules Plan for double coding ~ 20% Check agreement during the process
Is a System’s Wave Function in onetoone Correspondence with its Elements
 of Reality?” Phys. Rev. Lett. 108 150402 (2012); arXiv:1111.6597
"... Although quantum mechanics is one of our most successful physical theories, there has been a longstanding debate about the interpretation of the wave function—the central object of the theory. Two prominent views are that (i) it corresponds to an element of reality, i.e. an objective attribute that ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
that multiple systems can be prepared such that their elements of reality are uncorrelated. Here we show, based only on the assumption that measurement settings can be chosen freely, that a system’s wave function is in onetoone correspondence with its elements of reality. This also eliminates the possibility
Comparison of Statistical Shape Models Built on Correspondence Probabilities and OnetoOne Correspondences
"... In this paper, we present a method to compute a statistical shape model based on shapes which are represented by unstructured point sets with arbitrary point numbers. A fundamental problem when computing statistical shape models is the determination of correspondences between the observations of the ..."
Abstract
 Add to MetaCart
In this paper, we present a method to compute a statistical shape model based on shapes which are represented by unstructured point sets with arbitrary point numbers. A fundamental problem when computing statistical shape models is the determination of correspondences between the observations
Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A Onetoone Correspondence and Mining Algorithms
, 2007
"... Maximal biclique (also known as complete bipartite) subgraphs can model many applications in web mining, business, and bioinformatics. Enumerating maximal biclique subgraphs from a graph is a computationally challenging problem, as the size of the output can become exponentially large with respect ..."
Abstract

Cited by 24 (8 self)
 Add to MetaCart
Maximal biclique (also known as complete bipartite) subgraphs can model many applications in web mining, business, and bioinformatics. Enumerating maximal biclique subgraphs from a graph is a computationally challenging problem, as the size of the output can become exponentially large with respect to the vertex number when the graph grows. In this paper, we efficiently enumerate them through the use of closed patterns of the adjacency matrix of the graph. For an undirected graph G without selfloops, we prove that: (i) the number of closed patterns in the adjacency matrix of G is even; (ii) the number of the closed patterns is precisely double the number of maximal biclique subgraphs of G; and (iii) for every maximal biclique subgraph, there always exists a unique pair of closed patterns that matches the two vertex sets of the subgraph. Therefore, the problem of enumerating maximal bicliques can be solved by using efficient algorithms for mining closed patterns, which are algorithms extensively studied in the data mining field. However, this direct use of existing algorithms causes a duplicated enumeration. To achieve high efficiency, we propose an O(mn) time delay algorithm for a nonduplicated enumeration, in particular for enumerating those maximal bicliques with a large size, where m and n are the number of edges and vertices of the graph respectively. We evaluate the high efficiency of our algorithm by comparing it to stateoftheart algorithms on three categories of graphs: randomly generated graphs, benchmarks, and a reallife protein interaction network. In this paper, we also prove that if selfloops are allowed in a graph, then the number of closed patterns in the adjacency matrix is not necessarily even; but the maximal bicliques are exactly the same as those of the graph after removing all the selfloops.
On onetoone correspondence of Gibbs distribution and reduced twoparticle distribution function
, 810
"... In this article it is shown that in an equilibrium classical canonical ensemble of molecules with twobody interaction and external field full Gibbs distribution can be uniquely expressed in terms of a reduced twoparticle distribution function. This means that while a number of particles N and a vo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this article it is shown that in an equilibrium classical canonical ensemble of molecules with twobody interaction and external field full Gibbs distribution can be uniquely expressed in terms of a reduced twoparticle distribution function. This means that while a number of particles N and a volume V are fixed the reduced twoparticle distribution function contains as much information about the equilibrium system as the whole canonical distribution. The latter is represented as an absolutely convergent power series relative to the reduced twoparticle distribution function. As an example a linear term of this expansion is calculated. It is also shown that Gibbs distribution function can de expressed in terms of reduced distribution function of the first order and pair correlation function.That is the later two functions contain the whole information about system under consideration. 1
ONETOONE CORRESPONDENCE BETWEEN GENERATING FUNCTIONALS AND COCYCLES ON QUANTUM GROUPS IN PRESENCE OF SYMMETRY
"... ar ..."
A onetoone correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P 4 sparse graphs *
"... Abstract In this note we show a onetoone correspondence between potentially optimal solutions to the cluster deletion problem in a graph G and potentially optimal solutions for the minimum sum coloring problem in G (i.e. the complement graph of G). We apply this correspondence to polynomially sol ..."
Abstract
 Add to MetaCart
Abstract In this note we show a onetoone correspondence between potentially optimal solutions to the cluster deletion problem in a graph G and potentially optimal solutions for the minimum sum coloring problem in G (i.e. the complement graph of G). We apply this correspondence to polynomially
A Morphable Model For The Synthesis Of 3D Faces
, 1999
"... In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly through an intuitive user interface. Users are assisted in two key problems of computer aided face modeling. First, new face i ..."
Abstract

Cited by 1088 (55 self)
 Add to MetaCart
images or new 3D face models can be registered automatically by computing dense onetoone correspondence to an internal face model. Second, the approach regulates the naturalness of modeled faces avoiding faces with an "unlikely" appearance. Starting from
Pictures and LittlewoodRichardson Crystals
, 904
"... Abstract. We shall describe the onetoone correspondence between the set of pictures and the set of LittlewoodRichardson crystals. 1. ..."
Abstract
 Add to MetaCart
Abstract. We shall describe the onetoone correspondence between the set of pictures and the set of LittlewoodRichardson crystals. 1.
Graphs and equations
, 2011
"... B There is a onetoone correspondence between a system of structural equations and a graphical model. B Example: ..."
Abstract
 Add to MetaCart
B There is a onetoone correspondence between a system of structural equations and a graphical model. B Example:
Results 1  10
of
60,075