Sciweavers

358 search results - page 31 / 72
» Protocols from perceptual observations
Sort
View
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 6 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
ASIACRYPT
2005
Springer
15 years 5 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
KR
2010
Springer
15 years 4 months ago
One Hundred Prisoners and a Lightbulb - Logic and Computation
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
Hans P. van Ditmarsch, Jan van Eijck, William Wu
HOTNETS
2010
14 years 6 months ago
Successive interference cancellation: a back-of-the-envelope perspective
Successive interference cancellation (SIC) is a physical layer capability that allows a receiver to decode packets that arrive simultaneously. While the technique is well known in...
Souvik Sen, Naveen Santhapuri, Romit Roy Choudhury...
FASE
2008
Springer
15 years 1 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt