4403 search results - page 581 / 881 » Galois Theory of Algorithms |
210
click to vote
COCO
2001
Springer
16 years 21 hour ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
190
click to vote
ECAI
2000
Springer
15 years 12 months ago
2000
Springer
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
199
click to vote
EUROCOLT
1999
Springer
15 years 11 months ago
1999
Springer
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
221
Voted
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
213
Voted
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Abstract. We propose a data mining model that captures the user navigation behaviour patterns. The user navigation sessions are modelled as a hypertext probabilistic grammar whose ...