2766 search results - page 160 / 554 » Algorithms for trigonometric polynomials |
125
click to vote
CPM
2001
Springer
15 years 8 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
139
click to vote
CPC
2006
15 years 4 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
JSC
2007
15 years 4 months ago
2007
Buchberger’s Gr¨obner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his PhD ...
144
click to vote
PR
2002
15 years 3 months ago
2002
This paper introduces a novel nonlinear extension of Fisher's classical linear discriminant analysis (FDA) known as high-order Fisher's discriminant analysis (HOFDA). Th...
106
click to vote
IJNSEC
2010
14 years 11 months ago
2010
In this paper we first propose two new concepts concerning the notion of key escrow schemes: provable partiality and independence. Roughly speaking, a scheme has provable partiali...