4924 search results - page 569 / 985 » Efficiency Improvement for NTRU |
234
click to vote
TAINN
2005
Springer
16 years 10 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
175
click to vote
PADS
2004
ACM
16 years 8 days ago
2004
ACM
: Time warp is a well-known optimistic mechanism for parallel execution of simulation programs. Implementing time warp using a connection-oriented communication approach is propose...
188
click to vote
ACRI
2004
Springer
16 years 7 days ago
2004
Springer
Modeling free-form shapes in 3D spaces based on strict physical laws require a considerable amount of computation time. Previous experiences with Cellular Automata demonstrated sub...
182
Voted
ADVIS
2004
Springer
16 years 7 days ago
2004
Springer
Emerging peer-to-peer services such as Freenet, Gnutella, Kazaa, and Napster provide an easy and efficient way to share resources and information. However, misuse or unfair exploit...
177
click to vote
CINQ
2004
Springer
16 years 7 days ago
2004
Springer
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...