6266 search results - page 4 / 1254 » New results on the computability and complexity of points - ... |
EOR
2008
13 years 7 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
ECOOP
2009
Springer
14 years 8 months ago
2009
Springer
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
ACIVS
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. Extrema of curvature are useful key points for different image analysis tasks. Indeed, polygonal approximation or arc decomposition methods used often these points to ini...
COMPGEOM
2004
ACM
14 years 27 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to vox...