4315 search results - page 244 / 863 » Sorting in linear time |
CPM
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
ICCV
2001
IEEE
14 years 11 months ago
2001
IEEE
Diffusion processes which are widely used in low level vision are presented as a result of an underlying stochastic process. The short-time non-linear diffusion is interpreted as ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
DAM
2006
13 years 9 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
DAC
2005
ACM
13 years 11 months ago
2005
ACM
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...