322 search results - page 6 / 65 » Least Expected Cost Query Optimization: What Can We Expect |
IJCV
2011
13 years 2 months ago
2011
Abstract We present an active learning framework that predicts the tradeoff between the effort and information gain associated with a candidate image annotation, thereby ranking un...
IWSEC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
CIDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
TCS
2008
13 years 7 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
IADIS
2003
13 years 8 months ago
2003
We study the optimization of the expected number of bytes that must be transferred by the Web server when a user visits one of its pages. Given a Web site, we want to find an assi...