681 search results - page 38 / 137 » Searching with expectations |
PODS
2010
ACM
15 years 4 months ago
2010
ACM
The hash table, especially its external memory version, is one of the most important index structures in large databases. Assuming a truly random hash function, it is known that i...
111
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Modeling a user’s click-through behavior in click logs is a challenging task due to the well-known position bias problem. Recent advances in click models have adopted the examin...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
120
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
123
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...