Sciweavers

17366 search results - page 3322 / 3474
» New Revision Algorithms
Sort
View
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
15 years 11 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
15 years 11 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
15 years 11 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang
ESORICS
2007
Springer
15 years 11 months ago
Cloak: A Ten-Fold Way for Reliable Covert Communications
A number of network covert channels have been proposed recently that may have important ramifications for Internet security and privacy. However, they could become ineffective in...
Xiapu Luo, Edmond W. W. Chan, Rocky K. C. Chang
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
15 years 11 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
« Prev « First page 3322 / 3474 Last » Next »