225 search results - page 4 / 45 » On Adaptive Integer Sorting |
ISCAPDCS
2004
13 years 9 months ago
2004
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
ALENEX
2007
13 years 10 months ago
2007
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
CIBCB
2005
IEEE
14 years 2 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
VLDB
1993
ACM
14 years 15 days ago
1993
ACM
- In real-time and goal-orienteddatabasesystems, the amountof memory assignedto queriesthat sort or join large relations may fluctuate due to contention from other higherpriority t...