907 search results - page 142 / 182 » Efficient Optimization of Iterative Queries |
JMLR
2002
13 years 8 months ago
2002
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
COMPUTING
2008
13 years 9 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
We address the issue of measuring storage, or query load distribution fairness in peer-to-peer data management systems. Existing metrics may look promising from the point of view ...
SIGMOD
2005
ACM
14 years 9 months ago
2005
ACM
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
The computational power needed for searching exponentially growing databases, such as GenBank, has increased dramatically. Three different implementations of the most widely used ...