Sciweavers

Share
IPL
2002
93views more  IPL 2002»
8 years 7 months ago
Storing information with extractors
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 ...
Amnon Ta-Shma
IPL
2002
65views more  IPL 2002»
8 years 7 months ago
A new bound for map labeling with uniform circle pairs
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...
Michael J. Spriggs, J. Mark Keil
IPL
2002
80views more  IPL 2002»
8 years 7 months ago
A note on models for non-probabilistic analysis of packet switching networks
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...
Adi Rosén
IPL
2002
125views more  IPL 2002»
8 years 7 months ago
A note concerning the closest point pair algorithm
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...
Martin Richards
IPL
2002
98views more  IPL 2002»
8 years 7 months ago
Evolutionary induced decision trees for dangerous software modules prediction
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...
Vili Podgorelec, Peter Kokol
IPL
2002
90views more  IPL 2002»
8 years 7 months ago
On the approximability of two tree drawing conventions
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 ...
Paolo Penna
IPL
2002
72views more  IPL 2002»
8 years 7 months ago
On the location of Steiner points in uniformly-oriented Steiner trees
Benny K. Nielsen, Pawel Winter, Martin Zachariasen
IPL
2002
110views more  IPL 2002»
8 years 7 months ago
New bounds on a hypercube coloring problem
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...
Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
books