Sciweavers

205 search results - page 23 / 41
» On the Competitive Complexity of Navigation Tasks
Sort
View
JSA
2006
103views more  JSA 2006»
13 years 8 months ago
FMESP: Framework for the modeling and evaluation of software processes
Nowadays, organizations face with a very high competitiveness and for this reason they have to continuously improve their processes. Two key aspects to be considered in the softwa...
Félix García, Mario Piattini, Franci...
EMNLP
2009
13 years 6 months ago
Better Synchronous Binarization for Machine Translation
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
ICASSP
2011
IEEE
13 years 6 days ago
Full-covariance UBM and heavy-tailed PLDA in i-vector speaker verification
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...
Pavel Matejka, Ondrej Glembek, Fabio Castaldo, M. ...
CLEF
2011
Springer
12 years 8 months ago
Approaches for Intrinsic and External Plagiarism Detection - Notebook for PAN at CLEF 2011
Plagiarism detection has been considered as a classification problem which can be approximated with intrinsic strategies, considering self-based information from a given document,...
Gabriel Oberreuter, Gaston L'Huillier, Sebasti&aac...
ACG
2009
Springer
14 years 3 months ago
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess
Evaluating agents in decision-making applications requires assessing their skill and predicting their behaviour. Both are well developed in Poker-like situations, but less so in mo...
Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta