Sciweavers

1984 search results - page 315 / 397
» The colourful feasibility problem
Sort
View
MM
2010
ACM
203views Multimedia» more  MM 2010»
13 years 10 months ago
Processing web-scale multimedia data
The Internet brings us access to multimedia databases with billions of data instances. The massive amount of data available to researchers and application developers brings both o...
Malcolm Slaney, Edward Y. Chang
ECRTS
2010
IEEE
13 years 10 months ago
Improved Tardiness Bounds for Global EDF
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
Jeremy P. Erickson, UmaMaheswari Devi, Sanjoy K. B...
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 10 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Mosaic: Policy Homomorphic Network Extension
With the advent of large-scale cloud computing infrastructures, network extension has emerged as a major challenge in the management of modern enterprise networks. Many enterprise...
L. Erran Li, Michael F. Nowlan, Y. R. Yang
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 10 months ago
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
Robert Hildebrand, Matthias Köppe