3368 search results - page 207 / 674 » The Complexity of Query Reliability |
191
click to vote
NIS
1998
15 years 6 months ago
1998
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
183
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
151
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
168
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
XML data warehouses form an interesting basis for decisionsupport applications that exploit heterogeneous data from multiple sources. However, XML-native database systems currentl...
193
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...