149 search results - page 5 / 30 » Uniform hashing in constant time and linear space |
SPDP
1993
IEEE
13 years 11 months ago
1993
IEEE
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We propose a novel dependent hierarchical Pitman-Yor process model for discrete data. An incremental Monte Carlo inference procedure for this model is developed. We show that infe...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
SIAMNUM
2010
13 years 2 months ago
2010
In this paper, we study the superconvergence property for the discontinuous Galerkin (DG) and the local discontinuous Galerkin (LDG) methods, for solving one-dimensional time depe...
GCC
2004
Springer
14 years 25 days ago
2004
Springer
Distributed computing on heterogeneous nodes, or grid computing, provides a substantial increase in computational power available for many applications. This paper reports our expe...