Sciweavers

119 search results - page 15 / 24
» On finite alphabets and infinite bases
Sort
View
ITA
2006
13 years 9 months ago
Probabilistic models for pattern statistics
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
Massimiliano Goldwurm, Roberto Radicioni
ICARCV
2008
IEEE
151views Robotics» more  ICARCV 2008»
14 years 4 months ago
Model-Based Networked Control System stability based on packet drop distributions
Abstract—This paper studies the system stability of a ModelBased Networked Control System in the cases where packet losses follow a certain distributions. In this study, the unre...
Lanzhi Teng, Peng Wen, Wei Xiang
CSFW
2009
IEEE
14 years 1 months ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker
ECCC
2006
120views more  ECCC 2006»
13 years 9 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 10 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin