Concept

Ordered pair

Related publications (40)

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.

Co-occurrence Models for Image Annotation and Retrieval

Nikhil Garg

We present two models for content-based automatic image annotation and retrieval in web image repositories, based on the co-occurrence of tags and visual features in the images. In particular, we show how additional measures can be taken to address the noi ...

Idiap2009

File download and streaming system

Mohammad Amin Shokrollahi

A method of encoding data for transmission from a source to a destination over a communications channel is provided. The method operates on an ordered set of input symbols and includes generating a plurality of redundant symbols from the input symbols. The ...

2008

Calibration from statistical properties of the visual world

What does a blind entity need in order to determine the geometry of the set of photocells that it carries through a changing lightfield? In this paper, we show that very crude knowledge of some statistical properties of the environment is sufficient for th ...

2008

Calibration from statistical properties of the visual world

IDIAP2008

A fast local descriptor for dense matching

Pascal Fua, Vincent Lepetit, Engin Tola

We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm and this yields better wide-baseline performance than the commonly used corre ...

2008

Multi-stage code generator and decoder for communication systems

Mohammad Amin Shokrollahi

A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are ge ...

2006

Jurdzinski-ing Rabin and Streett

In this paper we give a recursive fixpoint characterization of the winning regions in Rabin and Streett games. We use this characterization in two ways. First, we introduce direct Rabin and Streett ranking that are a sound and complete way to characterize ...

2005

Long-range adsorbate interactions mediated by a two-dimensional electron gas

Klaus Kern, Harald Brune

We report on long-range interactions between adsorbates on metal surfaces with a surface state. A comparison of three adsorbate/substrate systems [Cu/Cu(111), Co/Cu(111), and Co/Ag(111)] suggests the general existence of such interactions and shows up comm ...

2002

Efficient identity based parameter selection for elliptic curve cryptosystems

Arjen Lenstra

A method is proposed that allows each individual party to an elliptic curve cryptosystem to quickly determine its own unique pair of finite field and Weierstrass equation, in such a way that the resulting pair provides adequate security. Although the choic ...

1999

Photoluminescence excitation spectra of disordered superlattices

We investigate photoluminescence excitation (PLE) and selective photoluminescence (SPL) of ordered and disordered superlattices, showing that the coexistence of localized and extended states in disordered superlattices produces a dramatic dependence of the ...

1998