Hamming Star-Convexity Packing in Information Storage
نویسندگان
چکیده
منابع مشابه
Hamming Star-Convexity Packing in Information Storage
A major puzzle in neural networks is understanding the information encoding principles that implement the functions of the brain systems. Population coding in neurons and plastic changes in synapses are two important subjects in attempts to explore such principles. This forms the basis of modern theory of neuroscience concerning self-organization and associative memory. Here we wish to suggest ...
متن کاملSize sensitive packing number for Hamming cube and its consequences
We prove a size-sensitive version of Haussler’s Packing lemma [7] for set-systems with bounded primal shatter dimension, which have an additional size-sensitive property. This answers a question asked by Ezra [9]. We also partially address another point raised by Ezra regarding overcounting of sets in her chaining procedure. As a consequence of these improvements, we get an improvement on the s...
متن کاملThe b-bibranching Problem: TDI System, Packing, and Discrete Convexity
In this paper, we introduce the b-bibranching problem in digraphs, which is a common generalization of the bibranching and b-branching problems. The bibranching problem, introduced by Schrijver (1982), is a common generalization of the branching and bipartite edge cover problems. Previous results on bibranchings include polynomial algorithms, a linear programming formulation with total dual int...
متن کاملThe Information Complexity of Hamming Distance
The Hamming distance function Hamn,d returns 1 on all pairs of inputs x and y that differ in at most d coordinates and returns 0 otherwise. We initiate the study of the information complexity of the Hamming distance function. We give a new optimal lower bound for the information complexity of the Hamn,d function in the small-error regime where the protocol is required to err with probability at...
متن کاملCloud Storage and Online Bin Packing
We study the problem of allocating memory of servers in a data center based on online requests for storage. Given an online sequence of storage requests and a cost associated with serving the request by allocating space on a certain server one seeks to select the minimum number of servers as to minimize total cost. We use two different algorithms and propose a third algorithm. We show that our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2011
ISSN: 1687-1812
DOI: 10.1155/2011/615274