1007 search results - page 9 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
SODA
2000
ACM
14 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
WADS
1993
Springer
15 years 1 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
150
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
RTAS
2008
IEEE
15 years 3 months ago
2008
IEEE
Instruction scratchpads have been previously suggested as a way to reduce the worst case execution time (WCET) of hard real-time programs without introducing the analysis issues p...