Concept

Tree structure

Related publications (71)

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.

Unified Framework Of Feature Based Adaptation For Statistical Speech Synthesis And Recognition

Lakshmi Babu Saheer

The advent of statistical parametric speech synthesis has paved new ways to a unified framework for hidden Markov model (HMM) based text to speech synthesis (TTS) and automatic speech recognition (ASR). The techniques and advancements made in the field of ...

Ecole Polytechnique Federale de Lausanne (EPFL)2012

Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors

Pascal Fua, Engin Türetken, Germán González Serrano

We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, ours builds a set of candidate trees over many different subsets ...

Humana Press2011

PLP: Page Latch-free Shared-everything OLTP

Anastasia Ailamaki, Frederick Ryan Johnson, Pinar Tözün, Ippokratis Pandis

Scaling the performance of shared-everything on-line transaction processing to highly-parallel multicore hardware remains a great challenge for database system designers. Developments in OLTP technology remove locking and logging from being scalability bot ...

2011

On an Efficient Decision Procedure for Imperative Tree Data Structures

Viktor Kuncak

We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invari ...

2011

, , ,

We present a novel receiver-driven p2p system for delivery of multiple concurrent time constrained data streams in overlay networks. We propose an effective combination of rateless coding with intra- and inter-session network coding to efficiently exploit ...

2011

A metric for phylogenetic trees based on matching

Bernard Moret, Yu Lin, Vaibhav Rajan

Comparing two or more phylogenetic trees is a fundamental task in computational biology. The simplest outcome of such a comparison is a pairwise measure of similarity, dissimilarity, or distance. A large number of such measures have been proposed, but so t ...

Springer Verlag2011

Delineating Trees in Noisy 2D Images and 3D Image Stacks

Pascal Fua, François Fleuret, Engin Türetken, Germán González Serrano

We present a novel approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, our method builds a set of candidate trees over many different subsets of point ...

2010

, ,

We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bifurcation points, and impose geometric constraints while optimizing a global cost funct ...

2010

A power-efficient, current-mode, binary-tree min / max circuit for Kohonen self-organizing feature maps and nonlinear filters

Rafal Tomasz Dlugosz

A novel current-mode, binary-tree Min / Max circuit for application in analog neural networks and filters has been presented. In the proposed circuit input currents are first converted to step signals with equal amplitudes and different delays that are pro ...

2010

NC Node Selection Game in Collaborative Streaming Systems

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distributed streaming systems. It permits to take advantage of the path and node diversi ...

2010