Sciweavers

759 search results - page 30 / 152
» Overlap-Free Regular Languages
Sort
View
CIKM
2004
Springer
14 years 1 months ago
Regularizing translation models for better automatic image annotation
The goal of automatic image annotation is to automatically generate annotations for images to describe their content. In the past, statistical machine translation models have been...
Feng Kang, Rong Jin, Joyce Y. Chai
ACL
2009
13 years 6 months ago
Stochastic Gradient Descent Training for L1-regularized Log-linear Models with Cumulative Penalty
Stochastic gradient descent (SGD) uses approximate gradients estimated from subsets of the training data and updates the parameters in an online fashion. This learning framework i...
Yoshimasa Tsuruoka, Jun-ichi Tsujii, Sophia Anania...
COGSCI
2011
85views more  COGSCI 2011»
13 years 3 months ago
Adaptation to Novel Accents: Feature-Based Learning of Context-Sensitive Phonological Regularities
This paper examines whether adults can adapt to novel accents of their native language that contain unfamiliar context-dependent phonological alternations. In two experiments, Fre...
Katrin Skoruppa, Sharon Peperkamp
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 27 days ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
WIA
2004
Springer
14 years 1 months ago
The Generalization of Generalized Automata: Expression Automata
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
Yo-Sub Han, Derick Wood