Sciweavers

MICCAI
2010
Springer
13 years 2 months ago
Probabilistic Multi-Shape Representation Using an Isometric Log-Ratio Mapping
Abstract. Several sources of uncertainties in shape boundaries in medical images have motivated the use of probabilistic labeling approaches. Although it is well-known that the sam...
Neda Changizi, Ghassan Hamarneh
JSC
2010
85views more  JSC 2010»
13 years 3 months ago
On the minimum of a positive polynomial over the standard simplex
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
Gabriela Jeronimo, Daniel Perrucci
MP
2008
115views more  MP 2008»
13 years 4 months ago
An efficient approach to updating simplex multipliers in the simplex algorithm
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
Jian-Feng Hu, Ping-Qi Pan
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
13 years 4 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
13 years 4 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha

Source Code
1476views
15 years 5 months ago
Simplex Optimization Using Vtk 4.2
A C++ program that utilizes the quick and accurate implementation of the simplex method (i.e., unconstrained nonlinear optimization) using vtk 4.2.
M. Sabry Hassouna