Sciweavers

1576 search results - page 85 / 316
» Properties of Synthetic Optimization Problems
Sort
View
MP
2008
92views more  MP 2008»
13 years 10 months ago
Invariance and efficiency of convex representations
We consider two notions for the representations of convex cones: G-representation and liftedG-representation. The former represents a convex cone as a slice of another; the latter...
Chek Beng Chua, Levent Tunçel
ICPR
2004
IEEE
14 years 11 months ago
A Hierarchical Projection Pursuit Clustering Algorithm
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
Alexei D. Miasnikov, Jayson E. Rome, Robert M. Har...
AI
2008
Springer
13 years 10 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
MOC
2000
105views more  MOC 2000»
13 years 9 months ago
On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
Jin Qi-nian
CVPR
2006
IEEE
15 years 1 days ago
Visible Surface Reconstruction from Normals with Discontinuity Consideration
Given a dense set of imperfect normals obtained by photometric stereo or shape from shading, this paper presents an optimization algorithm which alternately optimizes until conver...
Tai-Pang Wu, Chi-Keung Tang