34 search results - page 6 / 7 » Implicit Factoring: On Polynomial Time Factoring Given Only ... |
CRYPTO
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...
ICPP
2007
IEEE
14 years 1 months ago
2007
IEEE
Quality of service (QoS) mechanisms allowing users to request for turn-around time guarantees for their jobs have recently generated much interest. In our previous work we had des...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
IJCV
2010
13 years 5 months ago
2010
We present an information theoretic approach to define the problem of structure from motion (SfM) as a blind source separation one. Given that for almost all practical joint densi...
GIS
2009
ACM
13 years 12 months ago
2009
ACM
More and more users are contributing and sharing more and more contents on the Web via the use of content hosting sites and social media services. These user–generated contents ...