1953 search results - page 251 / 391 » Embedded Probabilistic Programming |
109
click to vote
NGITS
1995
Springer
15 years 5 months ago
1995
Springer
This paper investigates the problem ofautomatically learning declarative models of information sources available on the Internet. We report on ILA, a domain-independent program th...
109
Voted
EMNLP
2004
15 years 3 months ago
2004
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
112
click to vote
PSB
2004
15 years 3 months ago
2004
ct The preferential conservation of transcription factor binding sites implies that non-coding sequence data from related species will prove a powerful asset to motif discovery. We...
133
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
127
click to vote
UAI
1997
15 years 3 months ago
1997
Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expresse...