Sciweavers

14548 search results - page 77 / 2910
» The Optimal Path-Matching Problem
Sort
View
TSC
2010
159views more  TSC 2010»
13 years 4 months ago
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
Benjamin Speitkamp, Martin Bichler
ICCV
2011
IEEE
12 years 10 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
ARC
2012
Springer
317views Hardware» more  ARC 2012»
12 years 5 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
SIAMJO
2010
112views more  SIAMJO 2010»
13 years 4 months ago
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
Zhi-Quan Luo, Shuzhong Zhang
TIT
2010
114views Education» more  TIT 2010»
13 years 4 months ago
Convergence of min-sum message-passing for convex optimization
Abstract--We establish that the min-sum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems, generalizin...
Ciamac Cyrus Moallemi, Benjamin Van Roy