Results 1  10
of
160,411
THE CONJUGACY PROBLEM AND RELATED PROBLEMS IN LATTICEORDERED GROUPS
, 2005
"... Abstract. We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the “generic ” latticeordered group Aut(R). We use these techniques in order to show that for all f, g ∈ Aut(R), the equation xfx = g is effectively solvable in Aut(R). 1. ..."
Abstract
 Add to MetaCart
Abstract. We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the “generic ” latticeordered group Aut(R). We use these techniques in order to show that for all f, g ∈ Aut(R), the equation xfx = g is effectively solvable in Aut(R). 1.
Conjugacy in latticeordered groups and right ordered groups
 J. Group Theory
"... We prove that if Gj are right orderable groups with nontrivial cyclic subgroups Cj (j = 1, 2), then the (group) free product of G1 and G2 with C1 and C2 amalgamated is right orderable. We will deduce this from our main theorem that every latticeordered group can be embedded in one in which there a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We prove that if Gj are right orderable groups with nontrivial cyclic subgroups Cj (j = 1, 2), then the (group) free product of G1 and G2 with C1 and C2 amalgamated is right orderable. We will deduce this from our main theorem that every latticeordered group can be embedded in one in which
The word problem for latticeordered groups
 Trans. Amer. Math. Soc
, 1983
"... To. W. W. Boone on the occasion of his 60 th birthday ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
To. W. W. Boone on the occasion of his 60 th birthday
Parametric Shape Analysis via 3Valued Logic
, 2001
"... Shape Analysis concerns the problem of determining "shape invariants"... ..."
Abstract

Cited by 660 (79 self)
 Add to MetaCart
Shape Analysis concerns the problem of determining "shape invariants"...
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
long time, ‘variational ’ problems have been identified mostly with the ‘calculus of variations’. In that venerable subject, built around the minimization of integral functionals, constraints were relatively simple and much of the focus was on infinitedimensional function spaces. A major theme
Markov Random Field Models in Computer Vision
, 1994
"... . A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is defined as the maximum a posteriori (MAP) probability estimate of the true labeling. The posterior probability is usually derived from a prior model and a likelihood model. The l ..."
Abstract

Cited by 515 (18 self)
 Add to MetaCart
. The latter relates to how data is observed and is problem domain dependent. The former depends on how various prior constraints are expressed. Markov Random Field Models (MRF) theory is a tool to encode contextual constraints into the prior probability. This paper presents a unified approach for MRF modeling
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
fields, including bioinformatics, communication theory, statistical physics, combinatorial optimization, signal and image processing, information retrieval and statistical machine learning. Many problems that arise in specific instances — including the key problems of computing marginals and modes
Verb Semantics And Lexical Selection
, 1994
"... ... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new ..."
Abstract

Cited by 520 (4 self)
 Add to MetaCart
... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 612 (12 self)
 Add to MetaCart
the complementary issue of designing classification algorithms that can deal with more complex outputs, such as trees, sequences, or sets. More generally, we consider problems involving multiple dependent output variables, structured output spaces, and classification problems with class attributes. In order
Results 1  10
of
160,411