Sciweavers

651 search results - page 65 / 131
» Index Sets and Universal Numberings
Sort
View
DM
2010
96views more  DM 2010»
13 years 9 months ago
On well-rounded sublattices of the hexagonal lattice
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, W...
JCO
2007
80views more  JCO 2007»
13 years 9 months ago
The wireless network jamming problem
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
Clayton W. Commander, Panos M. Pardalos, Valeriy R...
AML
2002
70views more  AML 2002»
13 years 9 months ago
On the formal points of the formal topology of the binary tree
Abstract Formal topology is today an established topic in the development of constructive mathematics and constructive proofs for many classical results of general topology have be...
Silvio Valentini
RSA
2002
71views more  RSA 2002»
13 years 8 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
13 years 10 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe