3618 search results - page 318 / 724 » Additive functions for number systems in function fields |
177
click to vote
ARITH
2003
IEEE
16 years 3 days ago
2003
IEEE
A high-radix composite algorithm for the computation of the powering function (¤¦¥ ) is presented in this paper. The algorithm consists of a sequence of overlapped operations: ...
197
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
196
click to vote
MPC
2010
Springer
15 years 11 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
166
click to vote
ICANNGA
2007
Springer
15 years 8 months ago
2007
Springer
Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ε-MOEA is done...
198
click to vote
IM
2007
15 years 8 months ago
2007
— Despite the automation in many domains, network management still requires a lot of manual interaction. With the ongoing rapid growth of the Internet and the number of connected...