Sciweavers

3244 search results - page 181 / 649
» On convex complexity measures
Sort
View
CVPR
2012
IEEE
13 years 4 months ago
Structured Local Predictors for image labelling
In this paper we introduce Structured Local Predictors (SLP) – A new formulation that considers the image labelling problem from a structured learning point of view. SLP are loc...
Samuel Rota Bulò, Peter Kontschieder, Marce...
STRINGOLOGY
2008
15 years 3 months ago
On the Uniform Distribution of Strings
In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
Sébastien Rebecchi, Jean-Michel Jolion
MP
2008
135views more  MP 2008»
15 years 1 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
JMLR
2010
144views more  JMLR 2010»
14 years 8 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
CISSE
2009
Springer
15 years 5 months ago
Unbiased Statistics of a Constraint Satisfaction Problem - a Controlled-Bias Generator
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
Denis Berthier