Sciweavers

63 search results - page 7 / 13
» Bounds on linear PDEs via semidefinite optimization
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
14 years 7 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
MOC
2000
109views more  MOC 2000»
14 years 9 months ago
A posteriori error estimation and adaptivity for degenerate parabolic problems
Abstract. Two explicit error representation formulas are derived for degenerate parabolic PDEs, which are based on evaluating a parabolic residual in negative norms. The resulting ...
Ricardo H. Nochetto, Alfred Schmidt, C. Verdi
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
15 years 10 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
SIAMCO
2008
96views more  SIAMCO 2008»
14 years 9 months ago
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
Jean B. Lasserre, Didier Henrion, Christophe Prieu...
TMC
2008
104views more  TMC 2008»
14 years 9 months ago
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....