Sciweavers

256 search results - page 31 / 52
» On a Generalized Notion of Mistake Bounds
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Improved thresholds for rank minimization
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
CSCLP
2006
Springer
13 years 11 months ago
Bipolar Preference Problems: Framework, Properties and Solving Techniques
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemin...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
JETAI
2010
115views more  JETAI 2010»
13 years 6 months ago
From soft constraints to bipolar preferences: modelling framework and solving issues
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
JSYML
2011
68views more  JSYML 2011»
12 years 10 months ago
Ramsey-like cardinals
This paper continues the study of the Ramsey-like large cardinals introduced in [Git09] and [WS08]. Ramsey-like cardinals are defined by generalizing the “existence of elementar...
Victoria Gitman