Results 11 to 20 of about 6,828,332 (298)

Session Types = Intersection Types + Union Types [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
We propose a semantically grounded theory of session types which relies on intersection and union types. We argue that intersection and union types are natural candidates for modeling branching points in session types and we show that the resulting ...
Luca Padovani
doaj   +3 more sources

The Clique Problem in Ray Intersection Graphs [PDF]

open access: yesDiscrete & Computational Geometry, 2011
Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph.
Cardinal, Jean   +5 more
core   +9 more sources

The intersection type unification problem [PDF]

open access: yes, 2022
Art. 19, 16 S.The intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the unification problem is decidable.
Dudenhefner, A., Rehof, J., Martens, M.
core   +2 more sources

The unimodular intersection problem [PDF]

open access: yesOperations Research Letters, 2015
We show that finding minimally intersecting $n$ paths from $s$ to $t$ in a directed graph or $n$ perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
Volker Kaibel   +2 more
openaire   +2 more sources

The matroid intersection cover problem [PDF]

open access: yesOperations Research Letters, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sungjin Im, Benjamin Moseley, Kirk Pruhs
openaire   +2 more sources

Geometric intersection problems [PDF]

open access: yes17th Annual Symposium on Foundations of Computer Science (sfcs 1976), 1976
We develop optimal algorithms for forming the intersection of geometric objects in the plane and apply them to such diverse problems as linear programming, hidden-line elimination, and wire layout. Given N line segments in the plane, finding all intersecting pairs requires O(N2) time.
Michael Ian Shamos, Dan Hoey
openaire   +1 more source

When private set intersection meets big data : an efficient and scalable protocol [PDF]

open access: yes, 2013
Large scale data processing brings new challenges to the design of privacy-preserving protocols: how to meet the increasing requirements of speed and throughput of modern applications, and how to scale up smoothly when data being protected is big ...
Chen, Liqun, Wen, Zikai, Dong, Changyu
core   +4 more sources

On the Zarankiewicz Problem for Intersection Hypergraphs [PDF]

open access: yesJournal of Combinatorial Theory, Series A, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mustafa, Nabil, Pach, János
openaire   +8 more sources

An improvement on Furstenberg’s intersection problem [PDF]

open access: yesTransactions of the American Mathematical Society, 2021
In this paper, we study a problem posed by Furstenberg on intersections between × 2
openaire   +4 more sources

Intersection Safety using Lidar and Stereo Vision sensors [PDF]

open access: yes, 2011
International audienceIn this paper, we describe our approach for intersection safety developed in the scope of the European project INTERSAFE-2. A complete solution for the safety problem including the tasks of perception and risk assessment using on ...
Vu, Trung-Dung   +8 more
core   +2 more sources

Home - About - Disclaimer - Privacy