6274 search results - page 48 / 1255 » From query complexity to computational complexity |
ALGORITHMICA
2010
13 years 10 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
GIS
2010
ACM
13 years 8 months ago
2010
ACM
Reasoning about space has been a considerable field of study both in Artificial Intelligence and in spatial information theory. Many applications benefit from the inference of ...
PVLDB
2010
13 years 8 months ago
2010
Web technologies have enabled data sharing between sources but also simplified copying (and often publishing without proper attribution). The copying relationships can be complex...
AUSAI
2008
Springer
13 years 12 months ago
2008
Springer
When a user is looking for a product recommendation they usually lack expert knowledge regarding the items they are looking for. Ontologies on the other hand are crafted by experts...
TOC
2010
13 years 4 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...