1170 search results - page 28 / 234 » How Fast Is Too Fast |
116
click to vote
EUROCRYPT
1998
Springer
15 years 5 months ago
1998
Springer
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...
110
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
124
Voted
JCP
2007
15 years 22 days ago
2007
— In this paper we present a formal description of PROSA, a P2P resource management system heavily inspired by social networks. Social networks have been deeply studied in the la...
127
click to vote
MICCAI
2008
Springer
16 years 2 months ago
2008
Springer
This paper presents a new method for computing elastic and plastic deformations in the context of discrete deformable model-based registration. Internal forces are estimated by ave...
107
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...