Sciweavers

77 search results - page 4 / 16
» Approximation Lasso Methods for Language Modeling
Sort
View
117
Voted
ICML
2007
IEEE
16 years 1 months ago
Trust region Newton methods for large-scale logistic regression
Large-scale logistic regression arises in many applications such as document classification and natural language processing. In this paper, we apply a trust region Newton method t...
Chih-Jen Lin, Ruby C. Weng, S. Sathiya Keerthi
126
Voted
ACL
1997
15 years 2 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
106
Voted
EUROCRYPT
1999
Springer
15 years 5 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor
243
Voted
JMLR
2012
13 years 3 months ago
Approximate Inference in Additive Factorial HMMs with Application to Energy Disaggregation
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
J. Zico Kolter, Tommi Jaakkola
130
Voted
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 4 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli