1210 search results - page 165 / 242 » Newton's method and its use in optimization |
MP
2010
14 years 6 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
104
click to vote
ICML
2005
IEEE
16 years 20 days ago
2005
IEEE
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
ICIP
2005
IEEE
15 years 5 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
COR
2008
14 years 12 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
100
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Context based entropy coding has the potential to provide higher gain over memoryless entropy coding. However serious difficulties arise regarding the practical implementation in...