Sciweavers

422 search results - page 26 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Fast LCD motion deblurring by decimation and optimization
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
Stanley H. Chan, Truong Q. Nguyen
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
14 years 2 months ago
An optimized Linear Model Predictive Control solver for online walking motion generation
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
Dimitar Dimitrov, Pierre-Brice Wieber, Olivier Sta...
NIPS
2003
13 years 9 months ago
Learning a Distance Metric from Relative Comparisons
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...
Matthew Schultz, Thorsten Joachims
VC
2010
122views more  VC 2010»
13 years 6 months ago
Nonhomogeneous scaling optimization for realtime image resizing
We present a novel approach for interactive content-aware image resizing. The resizing is performed on warping a triangular mesh over the image, which captures the image saliency i...
Yong Jin, Ligang Liu, Qingbiao Wu
BICOB
2010
Springer
13 years 6 months ago
Multiple Kernel Learning for Fold Recognition
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...
Huzefa Rangwala