747 search results - page 102 / 150 » Theory and Construction of Molecular Computers |
158
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
185
click to vote
SCALESPACE
2005
Springer
15 years 11 months ago
2005
Springer
We investigate the use of fractional powers of the Laplacian for signal and image simplification. We focus both on their corresponding variational techniques and parabolic pseudod...
192
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
188
click to vote
ECCC
2007
15 years 6 months ago
2007
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
160
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...