Sciweavers

2124 search results - page 25 / 425
» An Efficient Framework for Order Optimization
Sort
View
CVPR
2009
IEEE
16 years 9 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ISCAS
2006
IEEE
106views Hardware» more  ISCAS 2006»
15 years 8 months ago
An efficient SNR scalability coding framework hybrid open-close loop FGS coding
Abstract—This paper presents a novel high-efficient hybrid openclose loop based fine granularity scalable (HOCFGS) coding framework supporting different decoding complexity appli...
Xiangyang Ji, Debin Zhao, Wen Gao, Jizheng Xu, Fen...
JMLR
2012
13 years 4 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
CVPR
2009
IEEE
16 years 9 months ago
Beyond Pairwise Energies: Efficient Optimization for Higher-order MRFs
In this paper, we introduce a higher-order MRF optimization framework. On the one hand, it is very general; we thus use it to derive a generic optimizer that can be applied to a...
Nikos Komodakis (University of Crete), Nikos Parag...
WSC
2001
15 years 3 months ago
A framework for distributed simulation optimization
The system presented bridges the gap between three different research areas: discrete event simulation, heuristic optimization methods and distributed systems technology. Its goal...
Björn Gehlsen, Bernd Page