601 search results - page 88 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
CRYPTO
1992
Springer
15 years 5 months ago
1992
Springer
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, w...
137
click to vote
JCB
2007
15 years 1 months ago
2007
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
118
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
102
click to vote
WSC
2008
15 years 3 months ago
2008
Semiconductor fabs often offer manufacturing service of multiple priorities in terms of cycle time-based X-factor targets (XFTs) and fab production must be planned accordingly. Th...