4536 search results - page 601 / 908 » Contention-Sensitive Data Structures and Algorithms |
181
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— SQL is a classical and powerful tool for querying relational databases. However, it is rather hard for inexperienced users to pose SQL queries, as they are required to be pro...
179
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
236
click to vote
JMLR
2012
13 years 9 months ago
2012
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
190
click to vote
ORL
2000
15 years 6 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
180
click to vote
CGF
1998
15 years 6 months ago
1998
We introduce a new data structure in the form of a light hierarchy for efficiently ray-tracing scenes with many light sources. An octree is constructed with the point light sourc...