4498 search results - page 44 / 900 » How to Invent Functions |
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
BCSHCI
2008
13 years 9 months ago
2008
Customer satisfaction with regard to user interfaces becomes increasingly more important and is, eventually, decisive for the selection of systems within a competitive market. End...
BMCBI
2006
13 years 7 months ago
2006
Background: Genome sequences vary strongly in their repetitiveness and the causes for this are still debated. Here we propose a novel measure of genome repetitiveness, the index o...
BC
1998
13 years 7 months ago
1998
Abstract. In a stereoscopic system, both eyes or cameras have a slightly dierent view. As a consequence, small variations between the projected images exist (`disparities') ...
LLC
2011
13 years 2 months ago
2011
Speech carries both linguistic content – phonemes, words, sentences – and talker information, sometimes called ‘indexical information’. While talker variability materially...