Sciweavers

13306 search results - page 2266 / 2662
» Theoretical Computer Science
Sort
View
EOR
2007
117views more  EOR 2007»
15 years 7 months ago
Simultaneous perturbation stochastic approximation of nonsmooth functions
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
Vaida Bartkute, Leonidas Sakalauskas
MP
2006
107views more  MP 2006»
15 years 7 months ago
Convergence theory for nonconvex stochastic programming with an application to mixed logit
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
206
Voted
MP
2006
110views more  MP 2006»
15 years 7 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
PAMI
2008
172views more  PAMI 2008»
15 years 7 months ago
A Theory Of Frequency Domain Invariants: Spherical Harmonic Identities for BRDF/Lighting Transfer and Image Consistency
This paper develops a theory of frequency domain invariants in computer vision. We derive novel identities using spherical harmonics, which are the angular frequency domain analog ...
Dhruv Mahajan, Ravi Ramamoorthi, Brian Curless
PAMI
2006
125views more  PAMI 2006»
15 years 7 months ago
Channel Smoothing: Efficient Robust Smoothing of Low-Level Signal Features
In this paper, we present a new and efficient method to implement robust smoothing of low-level signal features: B-spline channel smoothing. This method consists of three steps: en...
Michael Felsberg, Per-Erik Forssén, Hanno S...
« Prev « First page 2266 / 2662 Last » Next »