Sciweavers

442 search results - page 77 / 89
» An efficient class and object encoding
Sort
View
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 8 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
SIAMIS
2010
378views more  SIAMIS 2010»
13 years 1 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
14 years 4 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
13 years 9 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
JMLR
2010
110views more  JMLR 2010»
13 years 1 months ago
Attribute Selection Based on FRiS-Compactness
Commonly to classify new object in Data Mining one should estimate its similarity with given classes. Function of Rival Similarity (FRiS) is assigned to calculate quantitative mea...
Nikolay G. Zagoruiko, Irina V. Borisova, Vladimir ...