501 search results - page 85 / 101 » Rough Sets |
RECOMB
2004
Springer
15 years 11 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
STOC
2007
ACM
15 years 11 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
SAC
2010
ACM
15 years 6 months ago
2010
ACM
Service composition concerns both integration of heterogeneous distributed applications and dynamic selection of services. QoS-aware selection enables a service requester with cer...
120
click to vote
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
INFOCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
—Hash tables are extensively used in networking to implement data-structures that associate a set of keys to a set of values, as they provide O(1), query, insert and delete opera...