2766 search results - page 347 / 554 » Algorithms for trigonometric polynomials |
140
Voted
ESANN
2006
15 years 6 months ago
2006
Abstract. Response surfaces are a powerful tool for both classification and regression as they are able to model many different phenomena and construct complex boundaries between c...
132
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
136
click to vote
SODA
1990
ACM
15 years 5 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
121
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
127
Voted
COMPUTING
2007
15 years 4 months ago
2007
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...