Sciweavers

1736 search results - page 27 / 348
» String Extension Learning
Sort
View
IMCSIT
2010
15 years 1 months ago
Semi-Automatic Extension of Morphological Lexica
Abstract--We present a tool that facilitates the efficient extension of morphological lexica. The tool exploits information from a morphological lexicon, a morphological grammar an...
Tobias Kaufmann, Beat Pfister
ML
2007
ACM
106views Machine Learning» more  ML 2007»
15 years 3 months ago
Surrogate maximization/minimization algorithms and extensions
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
EUROCRYPT
1995
Springer
15 years 7 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
EMNLP
2008
15 years 5 months ago
Transliteration as Constrained Optimization
This paper introduces a new method for identifying named-entity (NE) transliterations in bilingual corpora. Recent works have shown the advantage of discriminative approaches to t...
Dan Goldwasser, Dan Roth
LICS
2008
IEEE
15 years 10 months ago
Piecewise Testable Tree Languages
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing