Sciweavers

370 search results - page 41 / 74
» Bounded modified realizability
Sort
View
FSE
2004
Springer
113views Cryptology» more  FSE 2004»
14 years 2 months ago
Minimum Distance between Bent and 1-Resilient Boolean Functions
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
Soumen Maity, Subhamoy Maitra
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
14 years 12 days ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
AINA
2008
IEEE
13 years 10 months ago
An Efficient Tree Structure for Delay Sensitive Data Gathering in Wireless Sensor Networks
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
Soonmok Kwon, Jeonggyu Kim, Cheeha Kim
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
13 years 8 months ago
Probabilistic performance of state estimation across a lossy network
We consider a discrete time state estimation problem over a packet-based network. In each discrete time step, a measurement packet is sent across a lossy network to an estimator u...
Michael Epstein, Ling Shi, Abhishek Tiwari, Richar...
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 8 months ago
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
K. Prasad, B. Sundar Rajan