Sciweavers

422 search results - page 38 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
AUTOMATICA
2007
110views more  AUTOMATICA 2007»
13 years 8 months ago
Stability analysis of systems with uncertain time-varying delays
Stability in presence of bounded uncertain time-varying delays in the feedback loop of a system is studied. The delay parameter is assumed to be an unknown time-varying function f...
Chung-Yao Kao, Anders Rantzer
JMLR
2006
89views more  JMLR 2006»
13 years 8 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
JMLR
2011
148views more  JMLR 2011»
13 years 3 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
DCC
2010
IEEE
14 years 2 months ago
On Computation of Performance Bounds of Optimal Index Assignment
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
Xiaolin Wu, Hans D. Mittelmann, Xiaohan Wang, Jia ...
ICALP
2005
Springer
14 years 1 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz