We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
Eduardo F. Barbosa, Gonzalo Navarro, Ricardo A. Ba...
One of the major problems for search at Web scale is that the search results on the large scale data might be huge and the users have to browse to find the most relevant ones. Plus...
Xu Ren, Yi Zeng, Yulin Qin, Ning Zhong, Zhisheng H...
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...
Philip Bohannon, Michael Flaster, Wenfei Fan, Raje...
The search for and correction of errors in software are often time consuming and expensive components of the total cost of software development. The current research investigates ...
Abstract: Nowadays, in the markets of broadband access services, traditional contracts are of "static" type. Customers buy the right to use a specific amount of resources...
Sergios Soursos, Costas Courcoubetis, Richard R. W...