41 search results - page 2 / 9 » isaac 2003 |
ISMAR
2003
IEEE
13 years 10 months ago
2003
IEEE
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such netw...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequ...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...