Concept

Subset

Related publications (49)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Homometric sets in trees

Radoslav Fulek, Slobodan Mitrovic

Let G = (V, E) denote a simple graph with vertex set V and edge set E. The profile of a vertex set V' subset of V denotes the multiset of pairwise distances between the vertices of V'. Two disjoint subsets of V are homometric if their profiles are the same ...

Academic Press Ltd- Elsevier Science Ltd2014

A Distributed Polling with Probabilistic Privacy

Rachid Guerraoui, Florian Huc, Yahya Benkaouz

In this paper, we present PDP, a distributed polling protocol that enables a set of participants to gather their opinion on a common interest without revealing their point of view. PDP does not rely on any centralized authority or on heavyweight cryptograp ...

2013

Comparing connectomes across subjects and populations at different scales

Jean-Philippe Thiran, Stephan Morgenthaler, Alessandra Griffa, Elda Fischi Gomez, Patric Hagmann, Djalel Eddine Meskaldji

Brain connectivity can be represented by a network that enables the comparison of the different patterns of struc- tural and functional connectivity among individuals. In the literature, two levels ofstatistical analysis have been con- sidered in comparing ...

2013

Erdos-Szekeres-type theorems for monotone paths and convex bodies

János Pach

For any sequence of positive integers j(1)< j(2)= 2 and q >= 2, what is the s ...

London Math Soc2012

The Exact Hausdorff Measure of the Zero Set of Fractional Brownian Motion

Thomas Mountford, Driss Baraka

Let {X(t), t is an element of R-N} be a fractional Brownian motion in R-d of index H. If L(0,I) is the local time of X at 0 on the interval I subset of R-N, then there exists a positive finite constant c(=c(N,d,H)) such that ...

Springer US2011

Minimum d-blockers and d-transversals in graphs

Dominique de Werra

We consider a set V of elements and an optimization problem on V: the search for a maximum (or minimum) cardinality subset of V verifying a given property a"similar to. A d-transversal is a subset of V which intersects any optimum solution in at least d el ...

2011

Compression with Graphical Constraints: An Interactive Browser

Amin Karbasi, Morteza Zadimoghaddam

We study the problem of navigating/searching through a database of objects with potentially different popularities using a membership oracle. The membership oracle, given a subset of objects

A

, and a target object

t

, determines whether

A

contains

t

...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Sup-norms of Eigenfunctions on Arithmetic Ellipsoids

Philippe Michel

Let B be a positive quaternion algebra, and let O subset of B be an Eichler order. There is associated, in a natural way, a variety X = X(O) the connected components of which are indexed by the ideal classes of O and are isomorphic to spheres. This variety ...

Oxford University Press2011

Labelling Game for Twitter Streams

Valérian Hanser

The main goal of this project is to build a mean and to populate a database with correct information regarding some decided pairings. This database will then be compared to the results of algorithms that process the same pairings, which provides a way to a ...

2010

A bipartite strengthening of the Crossing Lemma