29046 search results - page 173 / 5810 » Computable Models |
130
Voted
APAL
1998
15 years 3 months ago
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
115
Voted
IJCV
2007
15 years 3 months ago
2007
This paper presents an approach to multi-sensory and multi-modal fusion in which computer vision information obtained from calibrated cameras is integrated with a large-scale sent...
253
click to vote
SECO
2010
14 years 10 months ago
2010
In the Search Computing project, Web services are modeled by the Semantic Resource Framework (SRF). In this article, we argue that the SRF could benefit from ontological concepts b...
103
click to vote
MFCS
1989
Springer
15 years 7 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
99
Voted
INTERSPEECH
2010
14 years 10 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...