A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
We study keyword auctions in a model where each advertiser has a value for every slot, which is not necessarily proportional to the number of clicks the advertiser expects to rece...
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
This paper promotes the use of supervised machine learning in laboratory settings where chemists have a large number of samples to test for some property, and are interested in id...