19700 search results - page 28 / 3940 » DNA-Based Computation Times |
INTERSPEECH
2010
13 years 3 months ago
2010
Last year, we showed that the computation of a GMM-UBMbased speaker verification (SV) system may be sped up by 30 times by using a high-density discrete model (HDDM) on the NIST 2...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
RTS
2002
13 years 8 months ago
2002
In real-time computing systems, timing constraints imposed on application tasks are typically guaranteed off line using schedulability tests based on
RTSS
2003
IEEE
14 years 1 months ago
2003
IEEE
Real-time systems are growing in complexity and realtime and soft real-time applications are becoming common in general-purpose computing environments. Thus, there is a growing ne...
ACL
2009
13 years 6 months ago
2009
Many events in news articles don't include time arguments. This paper describes two methods, one based on rules and the other based on statistical learning, to predict the un...