Sciweavers

8825 search results - page 173 / 1765
» All for one or one for all
Sort
View
ICASSP
2011
IEEE
14 years 5 months ago
Collision resolution in multiple access networks with physical-layer network coding and distributed fountain coding
—We propose two new protocols based on physical layer network coding for collision resolution in multiple access networks. When a collision occurs the receiver decodes the sum of...
Giuseppe Cocco, Christian Ibars, Deniz Günd&u...
EVOW
2011
Springer
14 years 5 months ago
Towards Procedural Strategy Game Generation: Evolving Complementary Unit Types
The Strategy Game Description Game Language (SGDL) is intended to become a complete description of all aspects of strategy games, including rules, parameters, scenarios, maps, and ...
Tobias Mahlmann, Julian Togelius, Georgios N. Yann...
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 6 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 3 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
AAAI
2010
15 years 2 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer