Sciweavers

1118 search results - page 66 / 224
» Convex Optimization
Sort
View
CCCG
2010
15 years 6 months ago
Multi-guard covers for polygonal regions
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
135
Voted
ICIP
2010
IEEE
15 years 2 months ago
Total subset variation prior
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...
Sanjeev Kumar, Truong Q. Nguyen
DCC
2003
IEEE
16 years 4 months ago
Linear Programming Optimization for Video Coding under Multiple Constraints
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
Yegnaswamy Sermadevi, Sheila S. Hemami
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
15 years 11 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi
137
Voted
NIPS
2008
15 years 6 months ago
Fast Rates for Regularized Objectives
We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
Karthik Sridharan, Shai Shalev-Shwartz, Nathan Sre...