Sciweavers

2869 search results - page 221 / 574
» The Inference Problem: A Survey
Sort
View
CPAIOR
2010
Springer
15 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
CVPR
2011
IEEE
14 years 11 months ago
Supervised Hypergraph Labeling
We address the problem of labeling individual datapoints given some knowledge about (small) subsets or groups of them. The knowledge we have for a group is the likelihood value fo...
Toufiq Parag, Ahmed Elgammal
BMCBI
2008
116views more  BMCBI 2008»
15 years 7 months ago
IgTM: An algorithm to predict transmembrane domains and topology in proteins
Background: Due to their role of receptors or transporters, membrane proteins play a key role in many important biological functions. In our work we used Grammatical Inference (GI...
Piedachu Peris, Damián López, Marcel...
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 2 months ago
What Cannot be Learned with Bethe Approximations
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...
Uri Heinemann, Amir Globerson
WSDM
2012
ACM
325views Data Mining» more  WSDM 2012»
14 years 2 months ago
Coupled temporal scoping of relational facts
Recent research has made significant advances in automatically constructing knowledge bases by extracting relational facts (e.g., Bill Clinton-presidentOf-US) from large text cor...
Partha Pratim Talukdar, Derry Tanti Wijaya, Tom Mi...