83 search results - page 7 / 17 » Improving the Efficiency of Sorting by Reversals |
ICASSP
2009
IEEE
14 years 1 months ago
2009
IEEE
Copy-move forgery is a specific type of image tampering, where a part of the image is copied and pasted on another part of the same image. In this paper, we propose a new approac...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
MST
2002
13 years 6 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
VLDB
1989
ACM
13 years 11 months ago
1989
ACM
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...