1826 search results - page 269 / 366 » Using Random Forests in the Structured Language Model |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
CLEAR
2007
Springer
15 years 4 months ago
2007
Springer
The paper describes the IBM systems submitted to the NIST Rich Transcription 2007 (RT07) evaluation campaign for the speechto-text (STT) and speaker-attributed speech-to-text (SAST...
AAAI
1992
14 years 11 months ago
1992
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
TMI
2010
14 years 8 months ago
2010
—Synthetic magnetic resonance (MR) imaging is an approach suggested in the literature to predict MR images at different design parameter settings from at least three observed MR ...
101
click to vote
TAP
2010
Springer
14 years 7 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...