4488 search results - page 150 / 898 » Properties of NP-Complete Sets |
COLING
2008
13 years 8 months ago
2008
In this paper, we present a method for modeling joint information when generating n-best lists. We apply the method to a novel task of characterizing the similarity of a group of ...
APAL
1998
13 years 8 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
ISCAS
2002
IEEE
14 years 1 months ago
2002
IEEE
With single-electron tunneling (SET) technology it is possible to build electronic circuits with extreme low power properties. These SET circuits must therefore operate in the sin...
IACR
2011
12 years 7 months ago
2011
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...