Sciweavers

9 search results - page 2 / 2
» Universal sequence map (USM) of arbitrary discrete sequences
Sort
View
ICDT
2010
ACM
161views Database» more  ICDT 2010»
14 years 2 months ago
Composition with Target Constraints
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
Marcelo Arenas, Ronald Fagin, Alan Nash
NAR
1998
161views more  NAR 1998»
13 years 5 months ago
Touring protein fold space with Dali/FSSP
The FSSP database and its new supplement, the Dali Domain Dictionary, present a continuously updated classification of all known 3D protein structures. The classification is deriv...
Liisa Holm, Chris Sander
CCS
2001
ACM
13 years 9 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 2 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri