Sciweavers

3702 search results - page 194 / 741
» All Pairings Are in a Group
Sort
View
NIPS
2007
15 years 8 months ago
Retrieved context and the discovery of semantic structure
Semantic memory refers to our knowledge of facts and relationships between concepts. A successful semantic memory depends on inferring relationships between items that are not exp...
Vinayak Rao, Marc Howard
JUCS
2002
123views more  JUCS 2002»
15 years 6 months ago
Synchronization and Stability of Finite Automata
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
Jarkko Kari
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 5 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
PAIRING
2010
Springer
152views Cryptology» more  PAIRING 2010»
15 years 5 months ago
Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares
Threshold cryptography has been used to secure data and control access by sharing a private cryptographic key over different devices. This means that a minimum number of these dev...
Koen Simoens, Roel Peeters, Bart Preneel
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 1 months ago
Reed Muller Sensing Matrices and the LASSO
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
A. Robert Calderbank, Sina Jafarpour