We study investments in R&D and the formation of R&D clusters of firms which are competitors in the market. In a three stage game, firms first decide on the budget allocated to their R&D department, then form research clusters and finally compete in quantities. The second stage cluster formation is modeled by the unanimity game introduced in Bloch(1995). We show that for any distribution of R&D...

The re-emergence of large out-of-core datasets as well as the common usage of simulation methods including bootstrap and MCMC algorithms have resulted in timeconsuming computations. One solution to this problem, when feasible, is to break up the computation into small, quickly computable pieces. We discuss both some of the practical applications, as well as tools which facilitate these applicat...

R-Tree is a multidimensional indexing structure that forms basis for all the multidimensional indexing structures based on data partitioning. A number of attempts have been made in the past to improve the performance of R-Tree by manipulating the tree parameters and the data parameters. But hardly any attempt had been made to use external parameters such as disk parameters to enhance the perfor...