Concept

Hypertexte

Publications associées (10)

GDSP: A graphical perspective on the distributed storage systems

Michael Christoph Gastpar, Saeid Sahraei

The classical distributed storage problem can be modeled by a k-uniform complete hyper-graph where vertices represent servers and hyper-edges represent users. Hence each hyper-edge should be able to recover the full file using only the memories of the vert ...

2017

Fluid Dynamics and Outliers

Bernard André Vincent Calisti

The current craze for unicorns and other hyper growth companies brings a novel interest in what makes the exceptional performance of a firm. Literature about technological innovation explains the bond between the performance level reached by a company and ...

EPFL2017

A Scalable Approach to Harvest Modern Weblogs

Olivier Eric Paul Blanvillain

Blogs are one of the most prominent means of communication on the web. Their content, interconnections and influence constitute a unique socio-technical artefact of our times which needs to be preserved. The BlogForever project has established best practic ...

World Scientific Publ Co Pte Ltd2015

Perspectives for Rank Aggregation within Scientific Publication Databases

Martin Rajman, Martin Veselý

Ranking in scientific publication databases involves a variety of additional resources that are usually not applied in standard general purpose search engines. Moreover, community-specific expectations of users influence the perception of the adequacy of r ...

2008

Inferring Document Similarity from Hyper-links

Samy Bengio, David Grangier

Assessing semantic similarity between text documents is a crucial aspect in Information Retrieval systems. In this paper, we propose a technique to derive a similarity measure from hyper-link information. As linked documents are generally semantically clos ...

IDIAP2005

Exploiting Hyperlinks to Learn a Retrieval Model

Samy Bengio, David Grangier

Information Retrieval (IR) aims at solving a ranking problem: given a query

q

and a corpus

C

, the documents of

C

should be ranked such that the documents relevant to

q

appear above the others. This task is generally performed by ranking the documen ...

2005

Integrating visual and semantic descriptions for effective, flexible and user-friendly image retrieval

Zoran Pecenovic

Effectively managing a large collection of multimedia documents is a challenge, addressed by many disciplines from signal processing through database systems to artificial intelligence and interaction design. The problems to be solved have rarely been cons ...

EPFL2003

Linking Objects in Videos by Importance Sampling

Daniel Gatica-Perez

We present an approach to create hyper-links between video segments that contain objects of interest, based on video structuring, object definition, and stochastic object localization in the video structure. Localization is formulated in the Metric Mixture ...

2002

Linking Objects in Videos by Importance Sampling

Daniel Gatica-Perez

IDIAP2002

The CERN Host Interface

Ken Hollingworth

The authors discuss the CERN Host Interface Project, which aims to provide modular interfaces between Digital Equipment Corporation's VAX series computers and two popular high-energy physics buses, the VMEbus and FASTBUS. These user-programmable interfaces ...

1988

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Exploiting Hyperlinks to Learn a Retrieval Model

Samy Bengio, David Grangier

Information Retrieval (IR) aims at solving a ranking problem: given a query

q

and a corpus

C

, the documents of

C

should be ranked such that the documents relevant to

q

appear above the others. This task is generally performed by ranking the documen ...

2005