The classic cake-cutting problem is extended from individual agents to groups of agents. Applications include dividing a land-estate among families or dividing disputed lands among states. In the standard cake-cutting model, each agent should receive an individual subset of the cake with a sufficiently high individual value. In our model, each group should receive a subset with a sufficiently h...

The cake-cutting problem is a long-researched question of resource allocation. The problem asks the following: How can a group of players fairly divide a continuous resource (the cake) in an efficient manner if each player has a personal valuation of portions of the resource? The definitions of “fair” and “efficient” can easily complicate the problem. A concept of fairness must be defined at a ...

The design rationale for many key distribution schemes for multicast networks are based on heuristic arguments on e ciency exi bility and scalability In most instances the choice of key server placement in a multicast network architecture is based on intuitive cryptographic considerations We use an analytical model of multicast group formation and network growth to look at the selection of a ke...

We consider the problem of efficiently sharing large volumes of XML data based on distributed hash table overlay networks. Over the last three years, we have built ViP2P (standing for Views in Peerto-Peer), a platform for the distributed, parallel dissemination of XML data among peers. At the core of ViP2P stand distributed materialized XML views, defined as XML queries, filled in with data pub...

LEDA is a library of efficient data types and algorithms. At present, its strength is graph algorithms and the data structures related to them. The computational geometry part is evolving. The main features of the library are 1) a clear separation of specification and implementation 2) parameterized data types 3) a comfortable data type graph, and 4) its ease of use.

It is increasingly being used to transmit data on networks but is a verbose format and needs an efficient encoding to send relatively large amounts of data efficiently since XML became an official recommendation of the World Wide Web Consortium (W3C) in 1998. This requirement is particularly important, which is most for attractive to wireless data communications. It is a common technical challe...

Multiparadigm programming languages have been envisioned as a vehicle for constructing large and complex heterogeneous systems, such as a stock market exchange or a telecommunications network. General-purpose multiparadigm languages, as opposed to hybrid multiparadigm languages, embody several prevalent programming paradigms without being motivated by a single problem. One such language is Leda...

As introduced in Chapter 11 (Thomson, 2015), Fair Division refers to the general problem of fairly dividing a common resource among agents having different —and sometimes antagonistic— interests in the resource. But under this general term one can actually gather a cluster of very different problems, all calling for different solution concepts: after all, one can easily figure out that we canno...

To store and transmit the large amount of image data necessary for Image-based Rendering (IBR), efficient coding schemes are required. This paper presents two different approaches which exploit three–dimensional scene geometry for multi-view compression. In texture-based coding, images are converted to view-dependent texture maps for compression. In model-aided predictive coding, scene geometry...

We study the effects of Jupiter mass growth in order to permanently capture prograde satellites. Adopting the restricted three-body problem, Sun-Jupiter-Particle, we performed numerical simulations backward in time while considering the decrease in Jupiter’s mass. We considered the particle’s initial conditions to be prograde, at pericenter, in the region 100R ≤ a ≤ 400R and 0 ≤ e ≤ 0.5. The re...