332 search results - page 6 / 67 » Space Complexity vs. Query Complexity |
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
ICDE
2003
IEEE
14 years 11 months ago
2003
IEEE
XML path queries form the basis of complex filtering of XML data. Most current XML path query processing techniques can be divided in two groups. Navigation-based algorithms compu...
ALDT
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. We develop a Bayesian approach to concept learning for crowdsourcing applications. A probabilistic belief over possible concept definitions is maintained and updated acc...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our approach...
IJCV
2008
13 years 9 months ago
2008
Abstract We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our ...