5084 search results - page 877 / 1017 » Proving Possibility Properties |
164
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—The emerging biometric cryptography has gained significant interests for key management and privacy protection, but the previously proposed schemes using set metrics for finge...
146
click to vote
ASIACRYPT
2009
Springer
15 years 11 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
120
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
150
click to vote
DEXA
2009
Springer
15 years 11 months ago
2009
Springer
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
174
click to vote
HASKELL
2009
ACM
15 years 11 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...