Sciweavers

3495 search results - page 76 / 699
» On the random satisfiable process
Sort
View
EMNLP
2009
14 years 10 months ago
On the Use of Virtual Evidence in Conditional Random Fields
Virtual evidence (VE), first introduced by (Pearl, 1988), provides a convenient way of incorporating prior knowledge into Bayesian networks. This work generalizes the use of VE to...
Xiao Li
IANDC
2011
84views more  IANDC 2011»
14 years 7 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann
144
Voted
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
14 years 7 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
CORR
2011
Springer
179views Education» more  CORR 2011»
14 years 4 months ago
The restricted isometry property for time-frequency structured random matrices
We establish the restricted isometry property for finite dimensional Gabor systems, that is, for families of time–frequency shifts of a randomly chosen window function. We show...
Götz E. Pfander, Holger Rauhut, Joel A. Tropp
ICASSP
2011
IEEE
14 years 4 months ago
EM-style optimization of hidden conditional random fields for grapheme-to-phoneme conversion
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ...
Georg Heigold, Stefan Hahn, Patrick Lehnen, Herman...