In this paper an unsupervised compensation method based on Gestalt, ISVC, is proposed to address the problem of limited enrolling data and noise robustness in text-dependent speak...
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
Marcus Fontoura, Ronny Lempel, Runping Qi, Jason Y...
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
Ad hoc interaction between web services and their clients is a worthwhile but seemingly distant goal. This paper presents guided interaction as an alternative to the current mecha...
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...