Sciweavers

3110 search results - page 145 / 622
» On the initialization of the DNMF algorithm
Sort
View
ICGI
1994
Springer
15 years 10 months ago
Computer Assisted Grammar Construction
: This paper proposes a new inference approach for Chinese probabilistic context-free grammar, which implements the EM algorithm based on the bracket matching schemes. By utilizing...
S. J. Young, H.-H. Shih
SPAA
2000
ACM
15 years 9 months ago
Generalized connection caching
Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where the establishment...
Susanne Albers
NIPS
2003
15 years 7 months ago
Geometric Clustering Using the Information Bottleneck Method
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
Susanne Still, William Bialek, Léon Bottou
UAI
1996
15 years 7 months ago
Efficient Search-Based Inference for noisy-OR Belief Networks: TopEpsilon
Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been sh...
Kurt Huang, Max Henrion
ACL
1990
15 years 7 months ago
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
K. Vijay-Shanker, David J. Weir