2321 search results - page 154 / 465 » Multiple Predicate Learning |
159
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
130
Voted
EUROMICRO
1998
IEEE
15 years 8 months ago
1998
IEEE
The continuing explosive growth of the web has not been matched by an adequate enhancement of the infrastructure on which it depends. Both consumers and producers are often left f...
143
Voted
CIDR
2009
15 years 4 months ago
2009
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
157
Voted
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
Abstract— Previous work has introduced probability distributions as first-class components in uncertain stream database systems. A lacking element is the fact of how accurate the...
163
Voted
COLT
1993
Springer
15 years 7 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...