681 search results - page 9 / 137 » Searching with expectations |
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
110
click to vote
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Publication
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
100
click to vote
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
CCCG
2003
15 years 1 months ago
2003
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...