Publications related to Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

COMPLEXITY OF STOCHASTIC BRANCH AND BOUND METHODS FOR BELIEF TREE SEARCH IN BAYESIAN REINFORCEMENT LEARNING

There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most problems of interest, the optimal solution involves planning in an infinite ...

2009

Elastic Transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, a variant of the transactional model. Upon conflict detection, an elastic transaction might drop what it did so far within a separate transaction that immediately commits, and initiate a new transaction which might ...

2009

Elastic Transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, a variant of the transactional model. Upon conflict detection, an elastic transaction might drop what it did so far within a separate transaction that immediately commits, and initiate a new transaction which might ...

Springer2009

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

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

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 ...

IDIAP Research Institute2005

A Probabilistic Model for Chord Progressions

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 Probabilistic Model for Chord Progressions

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 ...

IDIAP2005

Chord Representations for Probabilistic Models

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, three different representations for chords are designe ...

IDIAP2005

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Graph Chatbot

Chat with Graph Search

COMPLEXITY OF STOCHASTIC BRANCH AND BOUND METHODS FOR BELIEF TREE SEARCH IN BAYESIAN REINFORCEMENT LEARNING

Elastic Transactions

Elastic Transactions

Service discovery, composition and execution for large scale open environments

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

A Graphical Model for Chord Progressions Embedded in a Psychoacoustic Space

A Graphical Model for Chord Progressions Embedded in a Psychoacoustic Space

A Probabilistic Model for Chord Progressions

A Probabilistic Model for Chord Progressions

Chord Representations for Probabilistic Models

Chord Representations for Probabilistic Models

COMPLEXITY OF STOCHASTIC BRANCH AND BOUND METHODS FOR BELIEF TREE SEARCH IN BAYESIAN REINFORCEMENT LEARNING

A Probabilistic Model for Chord Progressions

Service discovery, composition and execution for large scale open environments

Elastic Transactions

A Probabilistic Model for Chord Progressions

A Graphical Model for Chord Progressions Embedded in a Psychoacoustic Space

A Graphical Model for Chord Progressions Embedded in a Psychoacoustic Space

Elastic Transactions

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