6315 search results - page 316 / 1263 » Approximating Solution Structure |
175
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
206
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
174
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
190
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Search engines that support structured documents typically support structure created by the author (e.g., title, section), and may also support structure added by an annotation pr...
177
Voted
RTSS
2005
IEEE
16 years 8 days ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...