IPL
2011
13 years 2 months ago
2011
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
IPL
2011
13 years 2 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
IPL
2011
13 years 6 months ago
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
IPL
2011
13 years 6 months ago
2011
Fugue is an intriguing hash function design with a novel shift-register based compression structure and has formal security proofs e.g. against collision attacks. In this paper, w...
IPL
2011
13 years 6 months ago
2011
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
IPL
2011
13 years 6 months ago
2011
IPL
2011
13 years 6 months ago
2011
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKH...
IPL
2011
13 years 6 months ago
2011
The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the...
IPL
2011
13 years 6 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
IPL
2011
13 years 6 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...