Sciweavers

484 search results - page 68 / 97
» The number of convex permutominoes
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 10 months ago
Fractional generalizations of Young and Brunn-Minkowski inequalities
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...
Sergey Bobkov, Mokshay M. Madiman, Liyao Wang
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 10 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
DAM
2008
61views more  DAM 2008»
13 years 10 months ago
Scheduling malleable tasks with interdependent processing rates: Comments and observations
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
Edmund K. Burke, Moshe Dror, James B. Orlin
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 10 months ago
A Semidefinite Relaxation for Air Traffic Flow Scheduling
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
Alexandre d'Aspremont, Laurent El Ghaoui
IPL
2006
98views more  IPL 2006»
13 years 10 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...