Sciweavers

207 search results - page 16 / 42
» The Polynomial Method for Random Matrices
Sort
View
CDC
2008
IEEE
140views Control Systems» more  CDC 2008»
14 years 2 months ago
Model discrimination of polynomial systems via stochastic inputs
— Systems biologists are often faced with competing models for a given experimental system. Unfortunately, performing experiments can be time-consuming and expensive. Therefore, ...
Daniel Georgiev, Eric Klavins
CPAIOR
2010
Springer
13 years 11 months ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
JCISD
2006
114views more  JCISD 2006»
13 years 8 months ago
Ensemble of Linear Models for Predicting Drug Properties
We propose a new classification method for prediction of drug properties, called the Random Feature Subset Boosting for Linear Discriminant Analysis (LDA). The main novelty of this...
Tomasz Arodz, David A. Yuen, Arkadiusz Z. Dudek
JAT
2010
61views more  JAT 2010»
13 years 7 months ago
Close-to-optimal bounds for SU(N) loop approximation
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
Peter Oswald, Tatiana Shingel
MP
2010
150views more  MP 2010»
13 years 3 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels