Sciweavers

332 search results - page 8 / 67
» Convexity, Duality and Effects
Sort
View
CCCG
1993
13 years 9 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 2 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
DGCI
2008
Springer
13 years 9 months ago
Gift-Wrapping Based Preimage Computation Algorithm
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...
Yan Gérard, Fabien Feschet, David Coeurjoll...
SIAMJO
2002
120views more  SIAMJO 2002»
13 years 7 months ago
Dual Stochastic Dominance and Related Mean-Risk Models
We consider the problem of constructing mean{risk models which are consistent with the second degree stochastic dominance relation. By exploiting duality relations of convex analys...
Wlodzimierz Ogryczak, Andrzej Ruszczynski