2766 search results - page 162 / 554 » Algorithms for trigonometric polynomials |
141
click to vote
CISC
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
122
click to vote
COCO
1995
Springer
15 years 8 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
139
click to vote
CAD
2006
Springer
15 years 4 months ago
2006
Springer
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...
138
click to vote
DAM
2007
15 years 4 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
172
click to vote
WAOA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...