Sciweavers

4377 search results - page 335 / 876
» Mass problems and randomness
Sort
View
JCISD
2006
114views more  JCISD 2006»
15 years 6 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
187
Voted
TSP
2008
166views more  TSP 2008»
15 years 6 months ago
Linear Regression With Gaussian Model Uncertainty: Algorithms and Bounds
In this paper, we consider the problem of estimating an unknown deterministic parameter vector in a linear regression model with random Gaussian uncertainty in the mixing matrix. W...
Ami Wiesel, Yonina C. Eldar, Arie Yeredor
RSA
2008
69views more  RSA 2008»
15 years 6 months ago
Local resilience of graphs
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
Benny Sudakov, Van H. Vu
MST
2010
105views more  MST 2010»
15 years 5 months ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria
SAT
2010
Springer
152views Hardware» more  SAT 2010»
15 years 5 months ago
Simple but Hard Mixed Horn Formulas
Abstract. We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained. We show that the SAT problem for formulas in these cla...
Gayathri Namasivayam, Miroslaw Truszczynski