1168 search results - page 11 / 234 » Optimization strategies for complex queries |
VLDB
1998
ACM
13 years 12 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
ACL
2011
12 years 11 months ago
2011
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
SIGMOD
1998
ACM
13 years 12 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...