177 search results - page 14 / 36 » Uniform Hashing in Constant Time and Optimal Space |
MOC
2010
13 years 2 months ago
2010
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...