2042 search results - page 58 / 409 » Variable Number of |
114
Voted
CP
1999
Springer
15 years 4 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
100
click to vote
UAI
2003
15 years 1 months ago
2003
Methods for learning Bayesian networks can discover dependency structure between observed variables. Although these methods are useful in many applications, they run into computat...
115
click to vote
JMLR
2012
13 years 3 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
108
Voted
ORL
2008
15 years 16 days ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
98
Voted
KDD
2003
ACM
16 years 1 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...