2766 search results - page 434 / 554 » Algorithms for trigonometric polynomials |
TRS
2008
15 years 3 months ago
2008
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
130
click to vote
JAIR
2000
15 years 3 months ago
2000
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power&qu...
167
click to vote
DAM
1999
15 years 3 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
119
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
161
Voted
SAC
2002
ACM
15 years 3 months ago
2002
ACM
This article introduces a fast cross-validation algorithm that performs wavelet shrinkage on data sets of arbitrary size and irregular design and also simultaneously selects good ...