2626 search results - page 402 / 526 » The complexity of stochastic sequences |
160
click to vote
NPIV
1998
ACM
15 years 10 months ago
1998
ACM
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
187
click to vote
ISMVL
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper shows how the application of a CMOS ternary logic is useful in the realisation of Delay Insensitive (01)asynchronous circuits. It is shown that fully DIasynchronous cir...
211
click to vote
CF
2007
ACM
15 years 10 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
168
click to vote
BIOCOMP
2007
15 years 8 months ago
2007
Background: Natural antisense transcripts (NATs) are coding or non-coding RNAs with sequence complementarity to other transcripts (sense transcripts). These RNAs could potentially...
194
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...