Sciweavers

1174 search results - page 2 / 235
» Optimizing generics is easy!
Sort
View
SIAMDM
2010
117views more  SIAMDM 2010»
13 years 3 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
13 years 11 months ago
Extended Norm-Trace Codes with Optimized Correction Capability
We consider a generalization of the codes defined by norm and trace functions on finite fields introduced by Olav Geil. The codes in the new family still satisfy Geil’s dualit...
Maria Bras-Amorós, Michael E. O'Sullivan
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 2 months ago
Optimal Auctions with Correlated Bidders are Easy
We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there...
Shahar Dobzinski, Hu Fu, Robert Kleinberg
TOG
2012
230views Communications» more  TOG 2012»
11 years 7 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
ORL
2010
108views more  ORL 2010»
13 years 1 days ago
Easy distributions for combinatorial optimization problems with probabilistic constraints
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N(
Bernard Fortz, Michael Poss