Sciweavers

2143 search results - page 404 / 429
» corr 2010
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 10 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
CORR
2010
Springer
84views Education» more  CORR 2010»
14 years 10 months ago
On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack
As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Line...
Mohammad Reza Sohizadeh Abyaneh
69
Voted
CORR
2010
Springer
82views Education» more  CORR 2010»
14 years 10 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 10 months ago
Sub-Nyquist Sampling of Short Pulses: Part I
We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sam...
Ewa Matusiak, Yonina C. Eldar
89
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 10 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman