Sciweavers

8824 search results - page 164 / 1765
» On the Complexity of Real Functions
Sort
View
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 4 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
NAR
2011
252views Computer Vision» more  NAR 2011»
14 years 7 months ago
BISC: Binary SubComplexes in proteins database
Binary subcomplexes in proteins database (BISC) is a new protein–protein interaction (PPI) database linking up the two communities most active in their characterization: structu...
Thomas Juettemann, Dietlind L. Gerloff
STACS
2001
Springer
15 years 9 months ago
Randomness, Computability, and Density
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
ELPUB
2006
ACM
15 years 10 months ago
Modelling a Layer for Real-Time Management of Interactions in Web Based Distance Learning
In the last few years, the University of Aveiro, Portugal, has been offering several distance learning courses over the Web, using e-learning platforms. Experience showed that dif...
Carlos Sousa Pinto, Fernando M. S. Ramos
CISS
2008
IEEE
15 years 11 months ago
Costas permutations in the continuum
—We extend the definition of the Costas property to functions in the continuum, namely on intervals of the reals or the rationals, and argue that such functions can be used in t...
Konstantinos Drakakis, Scott Rickard