Now showing items 3-7 of 7

    • Efficient Algorithms for Optimal Video Transmission 

      Kozen, Dexter; Minsky, Yaron; Smith, Brian (Cornell University, 1995-05)
      This paper addresses the problem of sending an encoded video stream over a channel of limited bandwidth. When there is insufficient bandwidth available, some data must be dropped. For many video encodings, some data are ...
    • Efficient Reconciliation of Unordered Databases 

      Minsky, Yaron; Trachtenberg, Ari (Cornell University, 1999-11)
      We consider the problem of reconciling two unordered databases whose contents are related. Specifically, we wish to determine the mutual difference of these databases with a minimum communication complexity. This type ...
    • A Gossip-Style Failure Detection Service 

      Van Renesse, Robbert; Minsky, Yaron; Hayden, Mark (Cornell University, 1998-05)
      Failure Detection is valuable for system management, replication, load balancing, and other distributed services. To date, Failure Detection Services scale badly in the number of members that are being monitored. This paper ...
    • Set Reconciliation with Nearly Optimal Communication Complexity 

      Minsky, Yaron; Trachtenberg, Ari; Zippel, Richard (Cornell University, 2000-09-27)
      We consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity. This type of problem arises naturally from gossip protocols used for the distribution ...
    • Set Reconciliation with Nearly Optimal Communication Complexity 

      Minsky, Yaron; Trachtenberg, Ari; Zippel, Richard (Cornell University, 2000-04-28)
      We consider a fundamental problem that arises in the context of gossip protocols. Specifically, we consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the ...