3311 search results - page 405 / 663 » Modeling Relational Data by the Adjacency Model |
227
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
278
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
184
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
221
click to vote
ESANN
2006
15 years 8 months ago
2006
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
151
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
Micro-indels are small insertion or deletion events (indels) that occur during genome evolution. The study of micro-indels is important, both in order to better understand the unde...