Sciweavers

4126 search results - page 788 / 826
» Set based logic programming
Sort
View
COLT
1999
Springer
13 years 12 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
13 years 12 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
13 years 11 months ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
CPAIOR
2008
Springer
13 years 9 months ago
Propagating Separable Equalities in an MDD Store
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
Tarik Hadzic, John N. Hooker, Peter Tiedemann
EMSOFT
2008
Springer
13 years 9 months ago
Quantitative testing
We investigate the problem of specification based testing with dense sets of inputs and outputs, in particular with imprecision as they might occur due to errors in measurements, ...
Henrik C. Bohnenkamp, Mariëlle Stoelinga