Sciweavers

7758 search results - page 48 / 1552
» On the Number of Distributive Lattices
Sort
View
PDPTA
2000
13 years 10 months ago
Managing Distributed Systems with Smart Subscriptions
Abstract We describe an event-based, publishand-subscribe system based on using "smart subscriptions" to recognize weakly structured events. We present a hierarchy of sub...
Robert E. Filman, Diana D. Lee
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
14 years 2 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
TOC
2008
94views more  TOC 2008»
13 years 8 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
FOSSACS
2011
Springer
13 years 5 days ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 11 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman