3368 search results - page 241 / 674 » The Complexity of Query Reliability |
228
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
151
click to vote
CLUSTER
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper examines the suitability of different virtualization techniques in a high performance cluster environment. A survey of virtualization techniques is presented. Two repre...
129
click to vote
PPSC
1997
15 years 8 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
263
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
206
click to vote
ECCC
2010
15 years 5 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...