Sciweavers

7342 search results - page 1345 / 1469
» Optimal Language Learning
Sort
View
87
Voted
ICASSP
2009
IEEE
15 years 8 months ago
Automatic pronunciation verification of english letter-names for early literacy assessment of preliterate children
Children need to master reading letter-names and lettersounds before reading phrases and sentences. Pronunciation assessment of letter-names and letter-sounds read aloud is an imp...
Matthew Black, Joseph Tepperman, Abe Kazemzadeh, S...
111
Voted
WIA
2009
Springer
15 years 8 months ago
Short Regular Expressions from Finite Automata: Empirical Results
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
Hermann Gruber, Markus Holzer, Michael Tautschnig
109
Voted
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 8 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 8 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
SAT
2009
Springer
126views Hardware» more  SAT 2009»
15 years 8 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
« Prev « First page 1345 / 1469 Last » Next »