Sciweavers

1055 search results - page 17 / 211
» Convex Factorization Machines
Sort
View
SIGGRAPH
1993
ACM
15 years 2 months ago
On the form factor between two polygons
Form factors are used in radiosity to describe the fraction of diffusely reflected light leaving one surface and arriving at another. They are a fundamental geometric property us...
Peter Schröder, Pat Hanrahan
APPML
2010
91views more  APPML 2010»
14 years 10 months ago
Certificates of convexity for basic semi-algebraic sets
We provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of Rn. The first one is based on a necessary and sufficient condition whereas the second one...
Jean B. Lasserre
FOCS
2009
IEEE
15 years 4 months ago
Decomposing Coverings and the Planar Sensor Cover Problem
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
Matt Gibson, Kasturi R. Varadarajan
COLT
1997
Springer
15 years 2 months ago
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
Dimitris Bertsimas, David Gamarnik, John N. Tsitsi...
DAM
2007
84views more  DAM 2007»
14 years 10 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti