Results 1  10
of
263,860
All the facets of the six point Hamming cone
 European Journal of Combinatorics
, 1989
"... A finite semimetric is L¹−embeddable if it can be expressed as a nonnegative combination of Hamming semimetrics. The cone of such semimetrics is called the Hamming cone. A finite semimetric is called hypermetric if it satisfies the (2k + 1)−gonal inequalities which naturally generalize the triangle ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
inequality. With the aid of a computer we show that a semimetric on six points is hypermetric if and only if it is L¹−embeddable and give a complete list of the the facets of the six point Hamming cone. It is known that there are seven point hypermetrics that are not L¹−embeddable.
Classification of SixPoint Metrics
 Electronic Journal of Combinatorics
, 2004
"... There are 339 combinatorial types of generic metrics on six points. They correspond to the 339 regular triangulations of the second hypersimplex #(6, 2), which also has 14 nonregular triangulations. ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
There are 339 combinatorial types of generic metrics on six points. They correspond to the 339 regular triangulations of the second hypersimplex #(6, 2), which also has 14 nonregular triangulations.
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized
USER ACCEPTANCE OF INFORMATION TECHNOLOGY: TOWARD A UNIFIED VIEW
, 2003
"... Information technology (IT) acceptance research has yielded many competing models, each with different sets of acceptance determinants. In this paper, we (1) review user acceptance literature and discuss eight prominent models, (2) empirically compare the eight models and their extensions, (3) formu ..."
Abstract

Cited by 1665 (9 self)
 Add to MetaCart
acceptance model and the theory of planned behavior, the model of PC utilization, the innovation diffusion theory, and the social cognitive theory. Using data from four organizations over a sixmonth period with three points of measurement, the eight models explained between 17 percent and 53 percent
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
all be understood in terms of exact or approximate forms of these variational representations. The variational approach provides a complementary alternative to Markov chain Monte Carlo as a general source of approximation methods for inference in largescale statistical models.
Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2000
"... We present a unifying framework for studying the solution of multiclass categorization problems by reducing them to multiple binary problems that are then solved using a marginbased binary learning algorithm. The proposed framework unifies some of the most popular approaches in which each class ..."
Abstract

Cited by 560 (20 self)
 Add to MetaCart
is compared against all others, or in which all pairs of classes are compared to each other, or in which output codes with errorcorrecting properties are used. We propose a general method for combining the classifiers generated on the binary problems, and we prove a general empirical multiclass loss bound
The separation of ownership and control in East Asian Corporations
 Journal of Financial Economics
, 2000
"... We examine the separation of ownership and control for 2,980 corporations in nine East Asian countries. In all countries, voting rights frequently exceed cash#ow rights via pyramid structures and crossholdings. The separation of ownership and control is most pronounced among familycontrolled &quo ..."
Abstract

Cited by 573 (17 self)
 Add to MetaCart
We examine the separation of ownership and control for 2,980 corporations in nine East Asian countries. In all countries, voting rights frequently exceed cash#ow rights via pyramid structures and crossholdings. The separation of ownership and control is most pronounced among family
Least angle regression
 Ann. Statist
"... The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to s ..."
Abstract

Cited by 1308 (43 self)
 Add to MetaCart
The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope
Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package)
"... Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and bas ..."
Abstract

Cited by 812 (119 self)
 Add to MetaCart
and base pairing probabilities. An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary structures based on tree editing and alignment. All computer codes are written in ANSI C. They include
Results 1  10
of
263,860