1941 search results - page 147 / 389 » On the Hardness of Approximate Reasoning |
199
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
173
click to vote
NLDB
2007
Springer
16 years 19 days ago
2007
Springer
Various methodologies for structuring the process of domain modeling have been proposed, but there are few software tools that provide automatic support for the process of construc...
152
click to vote
ECAL
2005
Springer
16 years 20 hour ago
2005
Springer
Efficient hierarchical architectures for reconfigurable and adaptive multi-agent networks require dynamic cluster formation among the set of nodes (agents). In the absence of cen...
172
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
202
click to vote
CCS
1998
ACM
15 years 10 months ago
1998
ACM
This paper describes a new public-key cryptosystem based on the hardness of computing higher residues modulo a composite RSA integer. We introduce two versions of our scheme, one d...