Sciweavers

461 search results - page 15 / 93
» Practical polynomial factoring in polynomial time
Sort
View
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
14 years 8 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
ECCC
2002
74views more  ECCC 2002»
13 years 7 months ago
On the proper learning of axis parallel concepts
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
Nader H. Bshouty, Lynn Burroughs
PDCAT
2005
Springer
14 years 26 days ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
ACMSE
2006
ACM
13 years 11 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
FPL
2003
Springer
113views Hardware» more  FPL 2003»
14 years 18 days ago
Non-uniform Segmentation for Hardware Function Evaluation
This paper presents a method for evaluating functions in hardware based on polynomial approximation with non-uniform segments. The novel use of nonuniform segments enables us to ap...
Dong-U Lee, Wayne Luk, John D. Villasenor, Peter Y...