Secure set intersection protocols are the core building block for a manifold of privacy-preserving applications. In a recent work, Hazay and Lindell (ACM CCS 2008) introduced the idea of using trusted hardware tokens for the set intersection problem, devising protocols which improve over previous (in the standard model of two-party computation) protocols in terms of efficiency and secure compos...

In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This approach not only simplifies the understanding of and unifies many existing consistency results, but also directs the study of consistency to that of set inte...

Outerstring graphs are the intersection graphs of curves that lie inside a disk such that each curve intersects the boundary of the disk. Outerstring graphs are among the most general classes of intersection graphs studied. To date, no polynomial time algorithm is known for any of the classical graph optimization problems on outerstring graphs; in fact, most are NP-hard. It is known that there ...

This paper describes how the generation of 3-D models may be achieved from a small number of images. It uses an automatic segmentation technique and a two stage iterative camera calibration and volumetric intersection algorithm to produce a set of 3-D points in the form of a cloud of voxels. From this, a polygonal or B-spline based surface representation of an object can be generated. The B-spl...

The directed vertex leafage of a chordal graph G is the smallest integer k such that G is the intersection graph of subtrees of a rooted directed tree where each subtree has at most k leaves. In this note, we show how to find in time O(kn) an optimal colouring, a maximum independent set, a maximum clique, and an optimal clique cover of an n-vertex chordal graph G with directed vertex leafage k ...

Nowadays, geospatial information systems (GIS) are widely used to solve different spatial problems based on various types of fundamental data: spatial, temporal, attribute and topological relations. Topological relations are the most important part of GIS which distinguish it from the other kinds of information technologies. One of the important mechanisms for representing topological relations...

Adiabatic representation Representation in which the electronic wave functions are calculated for fixed (i.e., nonmoving) nuclei. Avoided intersection Case in which two potential energy surfaces come together but do not intersect. Conical intersection Case in which two potential energy surfaces intersect such that their separation decreases to zero linearly in the relevant nuclear coordinates. ...

By an ∈-representation of a relation we mean its isomorphic embedding to E = {〈x, y〉; x ∈ y}. Some theorems on such a representation are presented. Especially, we prove a version of the well-known theorem on isomorphic representation of extensional and well-founded relations in E, which holds in Zermelo-Fraenkel set theory. This our version is in Zermelo-Fraenkel set theory false. A general the...

We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an interval associated to one vertex has a nonempty intersection with an interval associated to the other vertex. A graph on n vertices is a k-gap interval graph ...

This paper describes a new representation for sortal constraints and a uniication algorithm for the corresponding constrained terms. Variables range over sets of terms described by systems of set constraints that can express limited inter-variable dependencies. These sets of terms are more general than regular tree languages, but are still closed under intersection. The new uniication algorithm...