Sciweavers

59 search results - page 2 / 12
» Fast Formal Analysis of Requirements via
Sort
View
ACL
2012
11 years 8 months ago
Fast Syntactic Analysis for Statistical Language Modeling via Substructure Sharing and Uptraining
Long-span features, such as syntax, can improve language models for tasks such as speech recognition and machine translation. However, these language models can be difficult to u...
Ariya Rastrow, Mark Dredze, Sanjeev Khudanpur
CAV
2008
Springer
125views Hardware» more  CAV 2008»
13 years 8 months ago
Application of Formal Word-Level Analysis to Constrained Random Simulation
Abstract. Constrained random simulation is supported by constraint solvers integrated within simulators. These constraint solvers need to be fast and memory efficient to maintain s...
Hyondeuk Kim, HoonSang Jin, Kavita Ravi, Petr Spac...
EUROCRYPT
1999
Springer
13 years 10 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
ICDAR
2011
IEEE
12 years 5 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
KDD
2004
ACM
131views Data Mining» more  KDD 2004»
14 years 6 months ago
Fast nonlinear regression via eigenimages applied to galactic morphology
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
Brigham Anderson, Andrew W. Moore, Andrew Connolly...