Sciweavers

156 search results - page 3 / 32
» An Enhancement of Major Sorting Algorithms
Sort
View
IPPS
2002
IEEE
14 years 7 days ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
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...
Minsoo Jeon, Dongseung Kim
ICDE
2009
IEEE
192views Database» more  ICDE 2009»
14 years 9 months ago
Topologically Sorted Skylines for Partially Ordered Domains
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...
Dimitris Sacharidis, Stavros Papadopoulos, Dimitri...
JACM
2006
98views more  JACM 2006»
13 years 7 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
ICSAP
2010
13 years 4 months ago
Enhanced Cost Effective Symmetric Key Algorithm for Small Amount of Data
Security being the major concern during data transfers, we have various challenges to face. The requirements of the security model vary depending on the type of data to be encrypte...
R. Satheesh Kumar, E. Pradeep, K. Naveen, R. Gunas...
CEC
2007
IEEE
14 years 1 months ago
NEMO: neural enhancement for multiobjective optimization
— In this paper, a neural network approach is presented to expand the Pareto-optimal front for multiobjective optimization problems. The network is trained using results obtained...
Aaron Garrett, Gerry V. Dozier, Kalyanmoy Deb