Sciweavers

14739 search results - page 102 / 2948
» An optimization problem on the sphere
Sort
View
DAGSTUHL
2004
14 years 11 months ago
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Erich Novak, Stephan Dahlke, Winfried Sickel
JC
2006
97views more  JC 2006»
14 years 10 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings II
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Stephan Dahlke, Erich Novak, Winfried Sickel
4OR
2007
99views more  4OR 2007»
14 years 10 months ago
Combinatorial optimization problems in wireless switch design
The purpose of this paper is to illustrate the diversity of combinatorial problems encountered in the design of wireless switching systems. This is done via a representative selec...
Renaud Sirdey
AAAI
2006
14 years 11 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...
CVPR
2012
IEEE
13 years 13 days ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys