629 search results - page 71 / 126 » The Generalized Quantum Database Search Algorithm |
UAI
1997
13 years 10 months ago
1997
Recently several researchers have investigated techniques for using data to learn Bayesian networks containing compact representations for the conditional probability distribution...
AIEDAM
1998
13 years 8 months ago
1998
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
ACMSE
2010
ACM
13 years 6 months ago
2010
ACM
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...