Sciweavers

537 search results - page 28 / 108
» A Theory of Inferred Causation
Sort
View
LICS
2008
IEEE
16 years 15 days ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
JMLR
2010
163views more  JMLR 2010»
15 years 27 days ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
CVPR
2000
IEEE
16 years 8 months ago
Order Parameters for Minimax Entropy Distributions: When Does High Level Knowledge Help?
Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In recent...
Alan L. Yuille, James M. Coughlan, Song Chun Zhu, ...
ENGL
2007
94views more  ENGL 2007»
15 years 6 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna
POPL
2011
ACM
14 years 9 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...