Sciweavers

58 search results - page 1 / 12
» Metric-Entropy Pairs on Lattices
Sort
View
JUCS
2007
99views more  JUCS 2007»
13 years 4 months ago
Metric-Entropy Pairs on Lattices
Abstract: We introduce the notion of ∧- and ∨-pairs of functions on lattices as an abstraction of the notions of metric and its related entropy for probability distributions. T...
Dan A. Simovici
COMPSAC
2003
IEEE
13 years 10 months ago
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen...
ICASSP
2011
IEEE
12 years 8 months ago
Adjugate pairs of sparse arrays for sampling two dimensional signals
Sparse sampling with coprime lattice arrays was introduced recently in the literature. It has been shown that a dense coarray can be constructed from such a pair of arrays, and is...
Palghat P. Vaidyanathan, Piya Pal
SEMWEB
2010
Springer
13 years 2 months ago
Using SPARQL to Test for Lattices: Application to Quality Assurance in Biomedical Ontologies
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
Guo-Qiang Zhang, Olivier Bodenreider
STACS
2009
Springer
13 years 11 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert