Sciweavers

2569 search results - page 201 / 514
» Approximate Objects and Approximate Theories
Sort
View
MOR
2007
138views more  MOR 2007»
15 years 6 months ago
The Demand-Matching Problem
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
F. Bruce Shepherd, Adrian Vetta
EDUTAINMENT
2010
Springer
15 years 5 months ago
Spectrally-Based Single Image Relighting
Abstract. This paper presents a new spectrally-based single image relighting approach. We first compute the spectral radiance of each stimulus on the monitor when displaying the i...
Xiaoxiong Xing, Weiming Dong, Xiaopeng Zhang, Jean...
WINE
2010
Springer
134views Economy» more  WINE 2010»
15 years 4 months ago
Truthful Mechanisms for Exhibitions
We consider the following combinatorial auction: Given a range space (U, R), and m bidders interested in buying only ranges in R, each bidder j declares her bid bj : R R+. We give...
George Christodoulou, Khaled M. Elbassioni, Mahmou...
CCE
2010
15 years 4 months ago
A simple heuristic for reducing the number of scenarios in two-stage stochastic programming
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
Ramkumar Karuppiah, Mariano Martín, Ignacio...
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
CUR from a Sparse Optimization Viewpoint
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
Jacob Bien, Ya Xu, Michael W. Mahoney