4940 search results - page 199 / 988 » On the Complexity of Universal Programs |
156
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we describe recent progress in i-vector based speaker verification. The use of universal background models (UBM) with full-covariance matrices is suggested and tho...
222
click to vote
NAR
2011
14 years 9 months ago
2011
The Universal PBM Resource for OligonucleotideBinding Evaluation (UniPROBE) database is a centralized repository of information on the DNAbinding preferences of proteins as determ...
175
click to vote
SAS
2009
Springer
2009
Springer
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
16 years 6 months ago
parsing: static analysis of dynamically generated string output using LR-parsing technology Kyung-Goo Doh1 , Hyunha Kim1 , David A. Schmidt2 1 Hanyang University, Ansan, South Kore...
179
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...
170
click to vote
SIGCSE
2010
ACM
15 years 11 months ago
2010
ACM
While the discipline of computing has evolved significantly in the past 30 years, Computer Science curricula have not as readily adapted to these changes. In response, we have rec...