Sciweavers

4488 search results - page 672 / 898
» Properties of NP-Complete Sets
Sort
View
SCN
2004
Springer
123views Communications» more  SCN 2004»
15 years 11 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros
SEKE
2004
Springer
15 years 11 months ago
Automatic Mapping of OWL Ontologies into Java
We present an approach for mapping an OWL ontology into Java. The basic idea is to create a set of Java interfaces and classes from an OWL ontology such that an instance of a Java ...
Aditya Kalyanpur, Daniel Jiménez Pastor, St...
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
15 years 11 months ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 11 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
ECCV
2010
Springer
15 years 11 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...