Sciweavers

2652 search results - page 258 / 531
» Privacy-preserving linear programming
Sort
View
150
Voted
ICALP
2009
Springer
16 years 3 months ago
On a Network Generalization of the Minmax Theorem
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
Constantinos Daskalakis, Christos H. Papadimitriou
103
Voted
ICFP
2003
ACM
16 years 3 months ago
Polish parsers, step by step
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and effic...
R. John M. Hughes, S. Doaitse Swierstra
149
Voted
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
15 years 10 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
127
Voted
ICDM
2009
IEEE
174views Data Mining» more  ICDM 2009»
15 years 10 months ago
Non-sparse Multiple Kernel Learning for Fisher Discriminant Analysis
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
Fei Yan, Josef Kittler, Krystian Mikolajczyk, Muha...
130
Voted
CPAIOR
2009
Springer
15 years 10 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...