Publication

Efficient Search in Unbalanced, Randomized Peer-To-Peer Search Trees

Publications associées (44)

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

Subtree-based bounds and simulation-based estimations for the partition function

Mehdi Molkaraie

Many different algorithms developed in statistical physics, coding theory, signal processing, and artificial intelligence can be expressed by graphical models and solved (either exactly or approximately) with iterative message-passing algorithms on the mod ...

EPFL2007

Service discovery, composition and execution for large scale open environments

Ion Constantinescu

In today's largest open environment, the World Wide Web, human-to-computer interactions are predominant. The natural evolution envisioned by many people is towards a Web in which the majority of interactions will be computer-to-computer. This has certain b ...

EPFL2006

Self-organizing structured peer-to-peer overlay networks

A peer-to-peer overlay network is a logical network, built on top of a physical network. In contrast to classical client-server distributed architectures, peer-to-peer overlay networks allow location of resources without centralized control. Existing overl ...

EPFL2006

Network of Shortcuts: An Adaptive Data Structure for Tree-Based Search Methods

Andrea Bergamini

In this work we present a novel concept of augmenting a search tree in a packet-processing system with an dditional data structure, a Network of Shortcuts, in order to adapt the search to current input traffic patterns and significantly speed-up the freque ...

2005

A Graphical Model for Chord Progressions Embedded in a Psychoacoustic Space

Samy Bengio, Jean-François Paiement

Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in music. In this paper, a distributed representation for chords is designed su ...

2005

A Graphical Model for Chord Progressions Embedded in a Psychoacoustic Space

Samy Bengio, Jean-François Paiement

IDIAP Research Institute2005

A Probabilistic Model for Chord Progressions

Samy Bengio, Jean-François Paiement

2005

A Probabilistic Model for Chord Progressions

Samy Bengio, Jean-François Paiement

IDIAP2005

The Quest for Balancing Peer Load in Structured Peer-to-Peer Systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

Structured peer-to-peer (P2P) systems are considered as the next generation application backbone on the Internet. An important problem of these systems is load balancing in the presence of non-uniform data distributions. In this paper we propose a complete ...

2003

Scalable Data Access in Peer-to-Peer Systems Using Unbalanced Search Trees

Karl Aberer

With the appearance of Peer-to-Peer information systems the interest in scalable and decentralized data access structures is attracting increasingly interest. We propose to that end P-Grid, a scalable data access structure resulting from the distribution o ...

2002