1623 search results - page 26 / 325 » No Sorting |
ACSC
2002
IEEE
15 years 5 months ago
2002
IEEE
The Block Sorting process of Burrows and Wheeler can be applied to any sequence in which symbols are (or might be) conditioned upon each other. In particular, it is possible to pa...
103
Voted
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
102
click to vote
ICPP
1995
IEEE
15 years 4 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
110
Voted
ALENEX
2003
15 years 2 months ago
2003
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
121
Voted
IJIT
2004
15 years 2 months ago
2004
Abstract-- We consider a hybrid knowledge representation system for ontological knowledge bases in order to maintain knowledge consistency between taxonomic knowledge and assertion...