77 search results - page 10 / 16 » Approximation Lasso Methods for Language Modeling |
116
click to vote
SIGGRAPH
2010
ACM
15 years 7 months ago
2010
ACM
Paper architectures are 3D paper buildings created by folding and cutting. The creation process of paper architecture is often laborintensive and highly skill-demanding, even with...
118
click to vote
ICLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
160
Voted
EMNLP
2009
15 years 10 days ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
226
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
155
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Korean is an agglutinative language that does not have explicit word boundaries. It is also a highly inflective language that exhibits severe coarticulation effects. These charac...