Sciweavers

458 search results - page 16 / 92
» Perfect Skolem sets
Sort
View
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 9 months ago
Differential Privacy in New Settings
Differential privacy is a recent notion of privacy tailored to the problem of statistical disclosure control: how to release statistical information about a set of people without ...
Cynthia Dwork
CISS
2007
IEEE
15 years 6 months ago
Limited Feedback Precoder Design for Spatially Correlated MIMO Channels
Abstract— It is well-known that perfect channel state information (CSI) at the transmitter and the receiver (CSIT/CSIR) can be used to decompose a multi-antenna channel into a ba...
Vasanthan Raghavan, Akbar M. Sayeed, Venugopal V. ...
WG
1993
Springer
15 years 4 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
RSA
2002
87views more  RSA 2002»
14 years 11 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
CMA
2010
68views more  CMA 2010»
14 years 9 months ago
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
Sandi Klavzar, Khaled Salem, Andrej Taranenko