282 search results - page 24 / 57 » Efficient bundle sorting |
ICASSP
2009
IEEE
14 years 2 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...
DOLAP
2003
ACM
14 years 19 days ago
2003
ACM
The normalization of a data cube is the process of choosing an ordering for the attribute values, and the chosen ordering will affect the physical storage of the cube’s data. For...
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...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
ISCC
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...