Sciweavers

48 search results - page 4 / 10
» Partial Lagrangian relaxation for general quadratic programm...
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Convex Quadratic Programming for Object Localization
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
Hao Jiang, Mark S. Drew, Ze-Nian Li
ISLPED
2006
ACM
99views Hardware» more  ISLPED 2006»
14 years 1 months ago
Thermal via allocation for 3D ICs considering temporally and spatially variant thermal power
All existing methods for thermal-via allocation are based on a steady-state thermal analysis and may lead to excessive number of thermal vias. This paper develops an accurate and ...
Hao Yu, Yiyu Shi, Lei He, Tanay Karnik
CVPR
2006
IEEE
14 years 9 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ICML
2008
IEEE
14 years 8 months ago
On partial optimality in multi-label MRFs
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rot...
NIPS
2000
13 years 9 months ago
Improved Output Coding for Classification Using Continuous Relaxation
Output coding is a general method for solving multiclass problems by reducing them to multiple binary classification problems. Previous research on output coding has employed, alm...
Koby Crammer, Yoram Singer