392 search results - page 25 / 79 » Reversal Complexity Revisited |
SWAT
2010
Springer
13 years 5 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
DCC
2009
IEEE
14 years 8 months ago
2009
IEEE
The RKLT is a lossless approximation to the KLT, and has been recently employed for progressive lossy-to-lossless coding of hyperspectral images. Both yield very good coding perfo...
WABI
2004
Springer
2004
Springer
Reversing Gene Erosion - Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data
14 years 27 days ago
In the last few years, it has become routine to use gene-order data to reconstruct phylogenies, both in terms of edge distances (parsimonious sequences of operations that transform...
ESAS
2004
Springer
14 years 28 days ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...