Sciweavers

953 search results - page 7 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
COMPUTING
2006
127views more  COMPUTING 2006»
13 years 7 months ago
PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
T. Gunji, S. Kim, K. Fujisawa, M. Kojima
GLVLSI
2003
IEEE
219views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Buffer sizing for minimum energy-delay product by using an approximating polynomial
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
Chang Woo Kang, Soroush Abbaspour, Massoud Pedram
JMLR
2010
161views more  JMLR 2010»
13 years 2 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
WWW
2005
ACM
14 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
DAGSTUHL
2006
13 years 9 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
Mark Giesbrecht, George Labahn, Wen-shin Lee