2766 search results - page 342 / 554 » Algorithms for trigonometric polynomials |
132
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
140
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
192
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
138
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
131
click to vote
CRYPTO
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Let pk = (N , e) be an RSA public key with corresponding secret key sk = (p, q, d, dp, dq , q-1 p ). Assume that we obtain partial error-free information of sk, e.g., ass...