Share This Author
Secure spread spectrum watermarking for multimedia
It is argued that insertion of a watermark under this regime makes the watermark robust to signal processing operations and common geometric transformations provided that the original image is available and that it can be successfully registered against the transformed watermarked image.
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
- F. Leighton
- Computer Science
- 1 September 1991
This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
- David R Karger, E. Lehman, F. Leighton, R. Panigrahy, Matthew S. Levine, D. Lewin
- Computer ScienceSTOC '97
- 4 May 1997
A family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network, based on a special kind of hashing that is called consistent hashing.
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
This paper establishes max-flow min-cut theorems for several important classes of multicommodity flow problems and uses the result to design the first polynomial-time (polylog n-times-optimal) approximation algorithms for well-known NP-hard optimization problems.
The value of knowing a demand curve: bounds on regret for online posted-price auctions
- Robert D. Kleinberg, F. Leighton
- Economics44th Annual IEEE Symposium on Foundations of…
- 11 October 2003
We consider price-setting algorithms for a simple market in which a seller has an unlimited supply of identical copies of some good, and interacts sequentially with a pool of n buyers, each of whom…
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
The main result is an algorithm for performing the task provided that the capacity of each cut exceeds the demand across the cut by a Theta (log n) factor.
Universal stability results for greedy contention-resolution protocols
- M. Andrews, B. Awerbuch, Antonio Fernández, J. Kleinberg, F. Leighton, Zhiyong Liu
- Computer Science, MathematicsProceedings of 37th Conference on Foundations of…
- 14 October 1996
This paper focuses on a basic adversarial model of packet generation and path determination for which the time-averaged injection rate of packets requiring the use of any edge is limited to be less than 1, and shows that there exist simple greedy protocols that are stable for all networks.
A Graph Coloring Algorithm for Large Scheduling Problems.
- F. Leighton
- Computer ScienceJournal of research of the National Bureau of…
- 1 November 1979
A new graph coloring algorithm is presented and shown to exhibit O(n 2) time behavior for most sparse graphs and thus is found to be particularly well suited for use with large-scale scheduling problems.
Resource discovery in distributed networks
This paper proposes a very simple algorithm called Name-Dropper whereby all machines learn about each other within O(log’ n) rounds with high probability, where n is the number of machines in the network.
Secure spread spectrum watermarking for images, audio and video
- I. Cox, J. Kilian, F. Leighton, T. Shamoon
- Computer ScienceProceedings of 3rd IEEE International Conference…
- 16 September 1996
The watermark can be constructed to make counterfeiting almost impossible, and the same digital watermarking algorithm can be applied to all three media under consideration with only minor modifications, making it especially appropriate for multimedia products.