739 search results - page 34 / 148 » Sorting Algorithms |
WABI
2005
Springer
14 years 1 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
PODS
2001
ACM
14 years 7 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
CCS
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
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...
JCSS
2008
13 years 7 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...