3244 search results - page 187 / 649 » On convex complexity measures |
123
click to vote
ICCSA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
110
click to vote
ISCAS
1994
IEEE
15 years 6 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
108
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
110
click to vote
WSCG
2004
15 years 3 months ago
2004
Image-based CSG rendering algorithms for standard graphics hardware rely on multipass rendering that includes reading and writing large amounts of pixel data from and to the frame...
119
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...