77 search results - page 6 / 16 » On Array Theory of Bounded Elements |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
COLT
2000
Springer
13 years 11 months ago
2000
Springer
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
BMCBI
2007
13 years 7 months ago
2007
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...