43264 search results - page 8212 / 8653 » Comparing models of computation |
130
Voted
SPIRE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
136
Voted
ASIACRYPT
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
146
Voted
CIKM
2001
Springer
15 years 8 months ago
2001
Springer
As mobile devices get ubiquitous and grow in computational power, their management of interdependent data also becomes increasingly important. The mobile environment exhibits all ...
150
click to vote
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
114
Voted
APSEC
2000
IEEE
15 years 8 months ago
2000
IEEE
of modelling abstractions to map from items in the real-world to objects in the computational domain is oth for the effective implementation of abstract problem solutions and for ...