Sciweavers

5084 search results - page 865 / 1017
» Proving Possibility Properties
Sort
View
ILP
2003
Springer
15 years 9 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain
COMPLIFE
2006
Springer
15 years 8 months ago
Beating the Noise: New Statistical Methods for Detecting Signals in MALDI-TOF Spectra Below Noise Level
Background: The computer-assisted detection of small molecules by mass spectrometry in biological samples provides a snapshot of thousands of peptides, protein fragments and prote...
Tim O. F. Conrad, Alexander Leichtle, Andre Hageh&...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 8 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
AMAST
2008
Springer
15 years 6 months ago
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
A simple type confusion attack occurs in a security protocol, when a principal interprets data of one type as data of another. These attacks can be successfully prevented by \taggi...
Han Gao, Chiara Bodei, Pierpaolo Degano
OWLED
2008
15 years 5 months ago
Representing Product Designs Using a Description Graph Extension to OWL 2
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
Henson Graves