Results 1  10
of
4,186
A constraint on the biembedding of Latin squares
"... This is a preprint of an article accepted for publication in the European Journal of Combinatorics c©2008 (copyright owner as specified in the journal). We give a necessary condition for the biembedding of two Latin squares in an orientable surface. As a consequence, it is shown that for n ≥ 2, the ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This is a preprint of an article accepted for publication in the European Journal of Combinatorics c©2008 (copyright owner as specified in the journal). We give a necessary condition for the biembedding of two Latin squares in an orientable surface. As a consequence, it is shown that for n ≥ 2
On biembeddings of Latin Squares
, 2009
"... A known construction for face 2colourable triangular embeddings of complete regular tripartite graphs is reexamined from the viewpoint of the underlying Latin squares. This facilitates biembeddings of a wide variety of Latin squares, including those formed from the Cayley tables of the elementary ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A known construction for face 2colourable triangular embeddings of complete regular tripartite graphs is reexamined from the viewpoint of the underlying Latin squares. This facilitates biembeddings of a wide variety of Latin squares, including those formed from the Cayley tables of the elementary
Regression Shrinkage and Selection Via the Lasso
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1994
"... We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients that are exactl ..."
Abstract

Cited by 4212 (49 self)
 Add to MetaCart
We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients
Direct least Square Fitting of Ellipses
, 1998
"... This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac  b² = 1 the new method incorporates the ellipticity constraint ..."
Abstract

Cited by 430 (3 self)
 Add to MetaCart
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac  b² = 1 the new method incorporates the ellipticity constraint
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 660 (8 self)
 Add to MetaCart
, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points
ON BIEMBEDDING AN IDEMPOTENT LATIN SQUARE WITH ITS TRANSPOSE
, 2013
"... Abstract. Let L be an idempotent Latin square of side n, thought of as a set of ordered triples (i, j, k) where L(i, j) = k. Let I be the set of triples (i, i, i). We consider the problem of biembedding the triples of L \ I with the triples of L \ I, where L is the transpose of L, in an orientable ..."
Abstract
 Add to MetaCart
Abstract. Let L be an idempotent Latin square of side n, thought of as a set of ordered triples (i, j, k) where L(i, j) = k. Let I be the set of triples (i, i, i). We consider the problem of biembedding the triples of L \ I with the triples of L \ I, where L is the transpose of L, in an orientable
1 Biembeddings of Latin squares of side 8
"... This is a preprint of an article accepted for publi ..."
Localityconstrained linear coding for image classification
 IN: IEEE CONFERENCE ON COMPUTER VISION AND PATTERN CLASSIFICATOIN
, 2010
"... The traditional SPM approach based on bagoffeatures (BoF) requires nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effective coding scheme called Localityconstrained Linear Coding (LLC) in place of the VQ coding in traditional SPM. LLC util ..."
Abstract

Cited by 443 (20 self)
 Add to MetaCart
The traditional SPM approach based on bagoffeatures (BoF) requires nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effective coding scheme called Localityconstrained Linear Coding (LLC) in place of the VQ coding in traditional SPM. LLC
Results 1  10
of
4,186