Sciweavers

1071 search results - page 133 / 215
» Programming with enumerable sets of structures
Sort
View
INDOCRYPT
2003
Springer
15 years 5 months ago
On Multiplicative Linear Secret Sharing Schemes
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
GCB
2008
Springer
174views Biometrics» more  GCB 2008»
15 years 1 months ago
Lightweight Comparison of RNAs based on Exact Sequence-structure Matches
: Specific functions of RNA molecules are often associated with different motifs in the RNA structure. The key feature that forms such an RNA motif is the combination of sequence ...
Steffen Heyne, Sebastian Will, Michael Beckstette,...
120
Voted
ENTCS
2008
120views more  ENTCS 2008»
15 years 20 days ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
116
Voted
ICOODB
2009
163views Database» more  ICOODB 2009»
14 years 10 months ago
Mapping XSD to OO Schemas
This paper presents algorithms that make it possible to process XML data that conforms to XML Schema (XSD) in a mainstream object-oriented programming language. These algorithms a...
Suad Alagic, Philip A. Bernstein
IEEEPACT
2009
IEEE
15 years 7 months ago
Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
Basilio B. Fraguela, Yevgen Voronenko, Markus P&uu...