2107 search results - page 59 / 422 » Computing Small Search Numbers in Linear Time |
149
Voted
DAGSTUHL
2007
15 years 4 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...
103
Voted
ECML
2007
Springer
15 years 8 months ago
2007
Springer
Choosing a suitable feature representation for structured data is a non-trivial task due to the vast number of potential candidates. Ideally, one would like to pick a small, but in...
158
click to vote
CDB
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be analyzed by currently available technolo...
107
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
— Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m is the numbe...
115
click to vote
RTAS
2002
IEEE
15 years 7 months ago
2002
IEEE
Delay variations (jitter) in computations and communications cause degradation of performance in control applications. There are many sources of jitter, including variations in ex...