Results 11  20
of
1,894
Details
, 2013
"... Description Performs hypothesis tests concerning a regression function in a leastsquares model, where the null is a parametric function, and the alternative is the union of largedimensional convex polyhedral cones. License GPL2  GPL3 ..."
Abstract
 Add to MetaCart
Description Performs hypothesis tests concerning a regression function in a leastsquares model, where the null is a parametric function, and the alternative is the union of largedimensional convex polyhedral cones. License GPL2  GPL3
A convexity theorem for torus actions on contact manifolds
"... Abstract. We show that the cone associated with a moment map for an action of a torus on a contact compact connected manifold is a convex polyhedral cone and that the moment map has connected fibers provided the dimension of the torus is bigger than 2 and that no orbit is tangent to the contact dist ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Abstract. We show that the cone associated with a moment map for an action of a torus on a contact compact connected manifold is a convex polyhedral cone and that the moment map has connected fibers provided the dimension of the torus is bigger than 2 and that no orbit is tangent to the contact
Hypermetric spaces and the Hamming cone
 Canad. J. Math
, 1981
"... 1. Definitions and preliminary results. We denote by d = (d12} •. • , din} d2z,..., dni>n) a vector of I 9 I distances between n points. Such a vector d is called a metric if it satisfies the triangle inequalities (1) d{j + djk ^ dik IS i,j, k S n. The set of all metrics on n points forms a conv ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
convex polyhedral cone, the extremal properties of which are discussed in [4]. We will be concerned with a subcone that is spanned by metrics of the form (2) dtJ(t) = { * \t JeV
Foliation Cones
 In Proceedings of the Kirbyfest, pages35–86, Geometry and Topology Monographs
, 1999
"... Abstract. David Gabai showed that disk decomposable knot and link complements carry taut foliations of depth one. In an arbitrary sutured 3manifold M, such foliations F, if they exist at all, are determined up to isotopy by an associated ray [F] issuing from the origin in H 1 (M; R) and meeting poi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
points of the integer lattice H 1 (M; Z). Here we show that there is a finite family of nonoverlapping, convex, polyhedral cones in H 1 (M; R) such that the rays meeting integer lattice points in the interiors of these cones are exactly the rays [F]. In the irreducible case, each of these cones
BRUHAT INTERVALS AND POLYHEDRAL CONES
"... Abstract. Lecture notes by Matthew Dyer for lectures at the workshop “Coxeter groups and convex geometry.” 1. Root labelled Bruhat graph 1.1. Bruhat order. Let (W, S) be a Coxeter group. Bruhat order is the partial order defined by the following proposition; see [3] and [13] for more details. Propos ..."
Abstract
 Add to MetaCart
Abstract. Lecture notes by Matthew Dyer for lectures at the workshop “Coxeter groups and convex geometry.” 1. Root labelled Bruhat graph 1.1. Bruhat order. Let (W, S) be a Coxeter group. Bruhat order is the partial order defined by the following proposition; see [3] and [13] for more details
What Is the Set of Images of an Objectunder All Possible Illumination Conditions?
"... npixel monochrome images of a convex object with a Lambertian reflectance function,illuminated by an arbitrary number of point light sources at infinity, forms a convex polyhedral cone in IRn andthat the dimension of this illumination cone equals the number of distinct surface normals. Furthermore, ..."
Abstract
 Add to MetaCart
npixel monochrome images of a convex object with a Lambertian reflectance function,illuminated by an arbitrary number of point light sources at infinity, forms a convex polyhedral cone in IRn andthat the dimension of this illumination cone equals the number of distinct surface normals. Furthermore, the
Graph implementations for nonsmooth convex programs
 Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences
, 2008
"... Summary. We describe graph implementations, a generic method for representing a convex function via its epigraph, described in a disciplined convex programming framework. This simple and natural idea allows a very wide variety of smooth and nonsmooth convex programs to be easily specified and effi ..."
Abstract

Cited by 263 (10 self)
 Add to MetaCart
and efficiently solved, using interiorpoint methods for smooth or cone convex programs. Key words: Convex optimization, nonsmooth optimization, disciplined convex programming, optimization modeling languages, semidefinite program
Hyperbolic cusps with convex polyhedral boundary
 Geom. Topol
"... We prove that a 3–dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by the metric induced on its boundary. Furthermore, any hyperbolic metric on the torus with cone singularities of positive curvature can be realized as the induced metric on the boundary of a convex ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
We prove that a 3–dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by the metric induced on its boundary. Furthermore, any hyperbolic metric on the torus with cone singularities of positive curvature can be realized as the induced metric on the boundary of a convex
LATTICE POINT GENERATING FUNCTIONS AND SYMMETRIC CONES
"... Abstract. We show that a recent identity of Beck–Gessel–Lee–Savage on the generating function of symmetrically contrained compositions of integers generalizes naturally to a family of convex polyhedral cones that are invariant under the action of a finite reflection group. We obtain general expressi ..."
Abstract
 Add to MetaCart
Abstract. We show that a recent identity of Beck–Gessel–Lee–Savage on the generating function of symmetrically contrained compositions of integers generalizes naturally to a family of convex polyhedral cones that are invariant under the action of a finite reflection group. We obtain general
Partitioning Contact State Space Using the Theory of Polyhedral Convex Cones
, 1994
"... The assembly plan from observation (APO) system observes a human operator perform an assembly task, analyzes the observations, models the task, and generates the programs for the robot to perform the same task. A major component of the APO system is the task recognition module, which models the obse ..."
Abstract
 Add to MetaCart
the part and its environment. This freedom can be represented as a polyhedral convex cone (PCC) in screw space. We show that any contact configuration can be classed into a finite number of contact states. These contact states correspond to topologically distinct intersections of the PCC with a linear
Results 11  20
of
1,894