Sciweavers

925 search results - page 20 / 185
» Connectivity on Complete Lattices
Sort
View
VISSYM
2007
15 years 2 months ago
Visualization of Uncertainty in Lattices to Support Decision-Making
Lattice graphs are used as underlying data structures in many statistical processing systems, including natural language processing. Lattices compactly represent multiple possible...
Christopher Collins, M. Sheelagh T. Carpendale, Ge...
CHARME
1999
Springer
100views Hardware» more  CHARME 1999»
15 years 4 months ago
Xs are for Trajectory Evaluation, Booleans are for Theorem Proving
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
Mark Aagaard, Thomas F. Melham, John W. O'Leary
ICIP
2005
IEEE
16 years 1 months ago
Fourier transform for the spatial quincunx lattice
We derive a new, two-dimensional nonseparable signal transform for computing the spectrum of spatial signals residing on a finite quincunx lattice. The derivation uses the connect...
Markus Püschel, Martin Rötteler
ECCC
2008
98views more  ECCC 2008»
14 years 12 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
15 years 3 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene