Sciweavers

14158 search results - page 2423 / 2832
» Generalized switch-setting problems
Sort
View
UAI
2003
15 years 8 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
ICISC
2000
126views Cryptology» more  ICISC 2000»
15 years 8 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
ACL
1997
15 years 8 months ago
Co-evolution of Language and of the Language Acquisition Device
A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a ...
Ted Briscoe
ACL
1997
15 years 8 months ago
A Theory of Parallelism and the Case of VP Ellipsis
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...
Jerry R. Hobbs, Andrew Kehler
IJCAI
1989
15 years 8 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine
« Prev « First page 2423 / 2832 Last » Next »