Sciweavers

14548 search results - page 204 / 2910
» The Optimal Path-Matching Problem
Sort
View
143
Voted
WSC
2008
15 years 2 months ago
Optimizing portfolio tail measures: Asymptotics and efficient simulation optimization
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
Sandeep Juneja
NECO
2007
95views more  NECO 2007»
15 years 2 days ago
Support Vector Ordinal Regression
In this paper, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal...
Wei Chu, S. Sathiya Keerthi
116
Voted
SIAMJO
2011
14 years 7 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
131
Voted
IJCV
2012
13 years 3 months ago
Sparse Occlusion Detection with Optical Flow
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
Alper Ayvaci, Michalis Raptis, Stefano Soatto
87
Voted
SSWMC
2004
15 years 1 months ago
On the complexity and hardness of the steganography embedding problem
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....