Baruch Awerbuch
- AGLP89.B. Awerbuch, A. Goldberg, M. Luby and S. Plotkin, Network decomposition and locality in distributed computation, Proc. 30th iEEE Syrup. on Foundations of Computer Science, 1989.Google Scholar
Digital Library
- AKP90.B. Awerbuch, S. Kutten and David Peleg. On buffer-economical store-andforward deadlock prevention, Proc. INFO- COM, 1991.Google Scholar
- A85.B. Awerbuch, Complexity of network synchronization, j. of the ACM 32, (1985), 804-823. Google ScholarDigital Library
- AP90a.B. Awerbuch and D. Peleg, Sparse Partitions, 31st IEEE Syrup. on Foundations of Computer Science, Oct. 1990, 503-513.Google ScholarDigital Library
- AP90b.B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead, 31st IEEE Syrup. on Foundations of Computer Science, 1990, pp. 514-422.Google ScholarDigital Library
- AP90c.B. Awerbuch and D. Peleg, Routing with polynomial communication-space trade-off, SIAM J. on Discrete Math., to appear. Google ScholarDigital Library
- AP90d.B. Awerbuch and D. Peleg, Efficient Distributed Construction of Sparse Covers, Technical Report CS90-17, The Weizmann Institute, July 1990.Google Scholar
- L78.L. Lamport, Time, clocks, and the ordering of events in a distributed system, Comm. of the ACM 21, (1978), 558-565. Google ScholarDigital Library
- LEH85.K.A. Lantz, J.L. Edighoffer and B.L. Histon, Towards a Universal Directory Service, 4th ACM Syrup. on Principles of Distributed Computing, 1985, pp. 261-271. Google ScholarDigital Library
- LS91.N. Linial and M. Saks, Decomposing Graphs Into Regions of Small Diameter, 2nd A CM Syrup. on Discrete Algorithms, San Francisco, 1991. Google ScholarDigital Library
- MV88.S.J. Mullender and P.M.B. Vitinyi, Distributed Match-Making, Algorithmica 3, (1988), pp. 367-391.Google ScholarDigital Library
- PS89.D. Peleg and A.A. Schi~ffer, Graph spanners, J. of Graph Theory 13, (1989), 99- 116.Google ScholarCross Ref
- PU89a.D. Peleg and J.D. Ullman, An optimal synchronizer for the hypercube. SIAM J. on Comput. 18, (1989), 740-747. Google ScholarDigital Library
- PU89b.D. Peleg and E. Upfal, A tradeoff between size and efficiency for routing tables, J. of the ACM 36, (1989), 510-530. Google ScholarDigital Library
- P89a.D. Peleg, Sparse Graph Partitions, Report CS89-01, Dept. of Applied Math., The Weizmann Institute, Rehovot, Israel, February 1989.Google Scholar
- P89b.D. Peleg, Distance-Dependent Distributed Directories, Information and Computation, to appear. Also as Report CS89-10, Dept. of Applied Math., The Weizmann Institute, Rehovot, Israel, May 1989.Google Scholar
Index Terms
- Concurrent online tracking of mobile users
Recommendations
Online updating appearance generative mixture model for meanshift tracking
This paper proposes an appearance generative mixture model based on key frames for meanshift tracking. Meanshift tracking algorithm tracks an object by maximizing the similarity between the histogram in tracking window and a static histogram acquired at ...
Vision Based Target Tracking and Collision Avoidance for Mobile Robots
A real-time object tracking and collision avoidance method is presented for mobile robot navigation in indoors environments using stereo vision and a laser sensor. Stereo vision is used to identify the target and to calculate its relative distance from ...
Online Multi-person Tracking by Tracker Hierarchy
AVSS '12: Proceedings of the 2012 IEEE Ninth International Conference on Advanced Video and Signal-Based SurveillanceTracking-by-detection is a widely used paradigm for multi-person tracking but is affected by variations in crowd density, obstacles in the scene, varying illumination, human pose variation, scale changes, etc. We propose an improved tracking-by-...
Comments