1603 search results - page 159 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
176
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
187
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
150
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
188
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
216
click to vote
CASES
2004
ACM
15 years 12 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...