7661 search results - page 301 / 1533 » Languages and the Computing Profession |
175
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
222
click to vote
TASLP
2008
15 years 6 months ago
2008
This paper describes an approach for computing a consensus translation from the outputs of multiple machine translation (MT) systems. The consensus translation is computed by weigh...
194
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
180
click to vote
SPIN
2010
Springer
15 years 5 months ago
2010
Springer
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
238
click to vote
TASLP
2011
15 years 1 months ago
2011
Abstract—The shifted delta cepstrum (SDC) is a widely used feature extraction for language recognition (LRE). With a high context width due to incorporation of multiple frames, S...