Sciweavers

1646 search results - page 38 / 330
» fast 2007
Sort
View
EMNLP
2006
13 years 11 months ago
Extremely Lexicalized Models for Accurate and Fast HPSG Parsing
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsur...
ACL
2001
13 years 11 months ago
Fast Decoding and Optimal Decoding for Machine Translation
A good decoding algorithm is critical to the success of any statistical machine translation system. The decoder's job is to find the translation that is most likely according...
Ulrich Germann, Michael Jahr, Kevin Knight, Daniel...
NIPS
2003
13 years 11 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
AROBOTS
2002
91views more  AROBOTS 2002»
13 years 9 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
CORR
2007
Springer
194views Education» more  CORR 2007»
13 years 10 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura