Unité

Groupe SCI IC PFP

Groupe

Publications associées (135)

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

Designing Example-critiquing Interaction

Boi Faltings, Pearl Pu Faltings, Paolo Viappiani

In many practical scenarios, users are faced with the problem of choosing the most preferred outcome from a large set of possibilities. As people are unable to sift through them manually, decisions support systems are often used to automatically find the o ...

2004

Scalable intelligent electronic catalogs

Marc Torrens Arnal

The world today is full of information systems which make huge quantities of information available. This incredible amount of information is clearly overwhelming Internet endusers. As a consequence, intelligent tools to identify worthwhile information are ...

EPFL2003

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

Recommenders' Influence on Buyers' Decision Process

Nicolas Jones

Online stores offer an increasingly large set of products. Interactive decision aids are becoming indispensable tools assisting users as they search for an ideal product to purchase. For an e-commerce website, adopting the correct tools can affect its surv ...

ACM2003

Distributed Versioning: Consistent Replication for Scaling Back-end Databases of Dynamic Content Sites

Willy Zwaenepoel

Dynamic content Web sites consist of a front-end Web server, an application server and a back-end database. In this paper we introduce distributed versioning, a new method for scaling the back-end database through replication. Distributed versioning provid ...

2003

Experience Implementing Caching of Dynamic Web Content with AOP

Willy Zwaenepoel

Caching is an appealing approach for server-side acceleration of dynamic content web sites. Previous work in this area provides either non-transparent caching obtained at the expense of considerable effort from the application programmer, or a transparent ...

2003

The Database State Machine Approach

Rachid Guerraoui, André Schiper, Fernando Pedone

Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We present the Database State Mac ...

2003

Hyperlink analysis for the Web

Monika Henzinger

Hyperlink analysis algorithms significantly improve the relevance of the search results on the Web, so much so that all major Web search engines claim to use some type of hyperlink analysis. However, the search engines do not disclose details about the typ ...

2001

Implementing e-Transactions with Asynchronous Replication

Rachid Guerraoui

An e-Transaction is one that executes exactly-once despite failures. This paper describes a distributed protocol that implements the abstraction of e-Transactionsin three-tier architectures. Three-tier architectures are typically Internet-oriented architec ...

2000

Cluster Reserves: A Mechanism for Resource Management in Cluster-based Network Servers

Willy Zwaenepoel

In network (e.g., Web) servers, it is often desirable to isolatethe performance of different classes of requests from each other. That is, one seeks to achieve that a certain minimalproportion of server resources are available for a class ofrequests, indep ...

2000