Sciweavers

26354 search results - page 82 / 5271
» How we refactor, and how we know it
Sort
View
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
14 years 23 days ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
COMPGEOM
1995
ACM
14 years 20 days ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
CRYPTO
2008
Springer
93views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Distributed Private Data Analysis: Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs
Amos Beimel, Kobbi Nissim, Eran Omri
LREC
2010
185views Education» more  LREC 2010»
13 years 10 months ago
How Certain are Clinical Assessments? Annotating Swedish Clinical Text for (Un)certainties, Speculations and Negations
Clinical texts contain a large amount of information. Some of this information is embedded in contexts where e.g. a patient status is reasoned about, which may lead to a considera...
Hercules Dalianis, Sumithra Velupillai
LREC
2010
146views Education» more  LREC 2010»
13 years 10 months ago
From XML to XML: The Why and How of Making the Biodiversity Literature Accessible to Researchers
We present the ABLE document collection, which consists of a set of annotated volumes of the Bulletin of the British Museum (Natural History). These were developed during our ongo...
Alistair Willis, David King, David Morse, Anton Di...