1632 search results - page 109 / 327 » Sublinear Time Algorithms for Metric Space Problems |
139
Voted
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
107
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
158
Voted
RTSS
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
139
Voted
EMNLP
2011
14 years 3 months ago
2011
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
162
Voted
PODS
2012
ACM
13 years 6 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...