Sciweavers

80 search results - page 4 / 16
» Bilevel Optimization with Nonsmooth Lower Level Problems
Sort
View
CVPR
2011
IEEE
13 years 1 months ago
Multi-Level Inference by Relaxed Dual Decomposition for Human Pose Segmentation
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...
Huayan Wang, Daphne Koller
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 5 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
SIAMJO
2008
72views more  SIAMJO 2008»
13 years 5 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
JGO
2008
115views more  JGO 2008»
13 years 5 months ago
Smoothing by mollifiers. Part I: semi-infinite optimization
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain r...
Hubertus Th. Jongen, Oliver Stein
COCOON
2005
Springer
13 years 11 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...