498 search results - page 18 / 100 » Estimating Robust Query Models with Convex Optimization |
SCIA
2009
Springer
14 years 2 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Many techniques for improving search result quality have been proposed. Typically, these techniques increase average effectiveness by devising advanced ranking features and/or by...
EDBT
2002
ACM
14 years 7 months ago
2002
ACM
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
BMCBI
2005
13 years 7 months ago
2005
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...