496 search results - page 58 / 100 » Machine models and lower bounds for query processing |
102
click to vote
ALT
2005
Springer
15 years 8 months ago
2005
Springer
In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
AIEDAM
2008
14 years 12 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
115
click to vote
NAACL
2003
15 years 1 months ago
2003
Searching online information is increasingly a daily activity for many people. The multilinguality of online content is also increasing (e.g. the proportion of English web users, ...
ALGORITHMICA
2002
14 years 11 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...