Sciweavers

1368 search results - page 16 / 274
» Generalized Rook Polynomials
Sort
View
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 8 months ago
Optimizing polynomials for floating-point implementation
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
Florent de Dinechin, Christoph Quirin Lauter
JCISD
2000
63views more  JCISD 2000»
13 years 8 months ago
The Permanental Polynomial
In earlier computer-aided studies the permanental polynomials of numerous fullerenes and benzenoid hydrocarbons were determined. Several relations between the coefficients of the ...
Gordon G. Cash
IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
13 years 3 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...
SIAMJO
2011
13 years 3 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye
ICML
2004
IEEE
14 years 9 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...