3341 search results - page 158 / 669 » On Bounded Queries and Approximation |
75
Voted
SIAMCOMP
2010
14 years 4 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
84
Voted
PAKDD
2009
ACM
15 years 2 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
PODS
2005
ACM
15 years 10 months ago
2005
ACM
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
77
Voted
JCSS
2006
14 years 10 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
158
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...