6274 search results - page 168 / 1255 » From query complexity to computational complexity |
126
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
124
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
239
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
132
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
122
click to vote
DBPL
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...