SODA
2000
ACM
13 years 11 months ago
2000
ACM
SODA
2000
ACM
13 years 11 months ago
2000
ACM
This presentation covers several sections of the paper by Berkman, Parnas and Sgall for the Advanced Topics in Network Security seminar. Ben-Gurion University of the Negev, fall 2...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
SODA
2000
ACM
13 years 11 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
SODA
2000
ACM
13 years 11 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
We consider the following two instances of the projective clustering problem: Given a set
SODA
2000
ACM
13 years 11 months ago
2000
ACM
SODA
1998
ACM
13 years 11 months ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...