Sciweavers

953 search results - page 9 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
ICML
2000
IEEE
14 years 8 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
TC
2010
13 years 6 months ago
TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections
—Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy. Prec...
Hanhua Chen, Jun Yan, Hai Jin, Yunhao Liu, Lionel ...
DAC
2006
ACM
14 years 8 months ago
Stochastic variational analysis of large power grids considering intra-die correlations
For statistical timing and power analysis that are very important problems in the sub-100nm technologies, stochastic analysis of power grids that characterizes the voltage fluctua...
Praveen Ghanta, Sarma B. K. Vrudhula, Sarvesh Bhar...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi
WEA
2009
Springer
104views Algorithms» more  WEA 2009»
14 years 2 months ago
Univariate Algebraic Kernel and Application to Arrangements
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...
Sylvain Lazard, Luis Mariano Peñaranda, Eli...