IPL
2002
13 years 11 months ago
2002
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
IPL
2002
13 years 11 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
IPL
2002
13 years 11 months ago
2002
IPL
2002
13 years 11 months ago
2002
IPL
2002
13 years 11 months ago
2002
We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types...
IPL
2002
13 years 11 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
IPL
2002
13 years 11 months ago
2002
We study the possibility of constructing decision trees with evolutionary algorithms in order to increase their predictive accuracy. We present a self-adapting evolutionary algori...
IPL
2002
13 years 11 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
IPL
2002
13 years 11 months ago
2002
IPL
2002
13 years 11 months ago
2002
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...