Sciweavers

681 search results - page 81 / 137
» et 2006
Sort
View
ACL
2006
14 years 11 months ago
Trace Prediction and Recovery with Unlexicalized PCFGs and Slash Features
This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
Helmut Schmid
CIC
2006
114views Communications» more  CIC 2006»
14 years 11 months ago
Tree Based Conference Key Establishment Cost Analysis and Minimization in Heterogeneous Networks
A shared secret, conference key, must be established among members to securely communicate among them. The Diffie-Hellman is often used for the conference key establishment. In a ...
Zhan Liu, Mi Lu
EACL
2006
ACL Anthology
14 years 11 months ago
Word Sense Induction: Triplet-Based Clustering and Automatic Evaluation
In this paper a novel solution to automatic and unsupervised word sense induction (WSI) is introduced. It represents an instantiation of the `one sense per collocation' obser...
Stefan Bordag
EACL
2006
ACL Anthology
14 years 11 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
FLAIRS
2006
14 years 11 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch