Sciweavers

9719 search results - page 203 / 1944
» Answer Set Optimization
Sort
View
CDC
2008
IEEE
291views Control Systems» more  CDC 2008»
15 years 8 months ago
Structured semidefinite representation of some convex sets
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems ...
J. William Helton, Jiawang Nie
IPL
2006
69views more  IPL 2006»
15 years 6 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...
JMIV
2007
136views more  JMIV 2007»
15 years 6 months ago
Image Compression Through a Projection onto a Polyhedral Set
In image denoising, many researchers have tried for several years to combine wavelet-like approaches and optimization methods (typically based on the total variation minimization)...
François Malgouyres
RSA
2011
131views more  RSA 2011»
15 years 1 months ago
On covering by translates of a set
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
Béla Bollobás, Svante Janson, Oliver...
FOCS
2008
IEEE
16 years 1 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson