1254 search results - page 25 / 251 » Making Hard Problems Harder |
SWAP
2007
13 years 8 months ago
2007
An issue that is equally arising both from social networks and the Semantic Web is the fact that, without the consistent use of the same identifier for an object across systems, i...
ASIACRYPT
2011
Springer
12 years 7 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
CBSE
2008
Springer
13 years 9 months ago
2008
Springer
The OSGiTM Service Platform is becoming the de facto standard for modularized Java applications. The market of OSGi based COTS components is continuously growing. OSGi specific pro...
IMC
2009
ACM
14 years 2 months ago
2009
ACM
With over half a billion users, Online Social Networks (OSNs) are the major new applications on the Internet. Little information is available on the network impact of OSNs, althou...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...