140 search results - page 20 / 28 » ipl 2008 |
119
click to vote
IPL
2008
15 years 1 months ago
2008
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom a...
IPL
2008
15 years 1 months ago
2008
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
IPL
2007
15 years 1 months ago
2007
A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y.J. García, M.A. López, S.T. Leuten...
145
click to vote
IPL
2007
15 years 1 months ago
2007
Bloom Filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori bas...
IPL
2007
15 years 1 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...