Sciweavers

2766 search results - page 27 / 554
» Algorithms for trigonometric polynomials
Sort
View
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 8 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer
ICTCS
2005
Springer
14 years 2 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
ISSAC
2007
Springer
199views Mathematics» more  ISSAC 2007»
14 years 2 months ago
A sparse modular GCD algorithm for polynomials over algebraic function fields
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
AAAI
2010
13 years 10 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
14 years 2 months ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park