Majid Imani

4 Questions 3 Answers 0 Followers

Questions related from Majid Imani

Is there a cache-oblivious kd-tree for orthogonal range searching that construction of it be better than O(Sort(N)) block transfers?

In the "Cache-Oblivious Data Structures forOrthogonal Range Searching" Pankaj K. Agarwal et al. proposed a cache-oblivious kd-tree that its construction is of O(Sort(N)) block transfers. Is there...

04 December 2015 4,920 0 View

Can anyone suggest to me some references of expected or average cache-oblivious analysis of a randomized cache-oblivious version of a kd-tree?

I need to analyze the amount of the expected block transfers in construction of a randomized kd-tree. Can anyone suggest me some references?

04 December 2015 8,550 2 View

What is difference between base cases in analysis of cache-oblivious algorithms, specially, cache-oblivious analysis of query answering in kd-tree?

Consider a kd-tree, just like as kd-tree definition in Mark de. Berg's computational geometry textbook. There are two different analyses of cache-complexity of query answering in the...

28 September 2015 2,655 2 View

Is there an alternative to divide and conquer to design cache-oblivious algorithms?

Best technique for designing cache-oblivious algorithms by my study is divide and conquer technique. Most articles I've read on this topic use D&C approach. But I would like to know whether...

01 September 2015 738 1 View