Sciweavers

Share
SODA
2003
ACM
116views Algorithms» more  SODA 2003»
9 years 1 months ago
Browsing around a digital library
What will it be like to work in the digital library of the future? We begin by browsing around an experimental digital library of the present, glancing at some collections and show...
Ian H. Witten
SODA
2003
ACM
103views Algorithms» more  SODA 2003»
9 years 1 months ago
On the rectilinear crossing number of complete graphs
We prove a lower bound of 0.3288   n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
Uli Wagner
SODA
2003
ACM
107views Algorithms» more  SODA 2003»
9 years 1 months ago
Fault-tolerant facility location
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
Chaitanya Swamy, David B. Shmoys
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
9 years 1 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
9 years 1 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
9 years 1 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
Hung Q. Ngo, Van H. Vu
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
9 years 1 months ago
Deterministic identity testing for multivariate polynomials
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
Richard J. Lipton, Nisheeth K. Vishnoi
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
9 years 1 months ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
SODA
2003
ACM
120views Algorithms» more  SODA 2003»
9 years 1 months ago
Certifying algorithms for recognizing interval graphs and permutation graphs
Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, ...
books