Concept

B-tree

Related publications (104)

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.

Scheduling multicasts on unit-capacity trees and meshes

Monika Henzinger

This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput-model. The problem is a generalization of the edge-disjoint paths problem and is NP-hard both on trees and meshes. We study b ...

SIAM1999

Parametric and kinetic minimum spanning trees

Monika Henzinger

We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter, and wish to computethe sequence of minimum spanning trees generated as, varies. We also consider the kinetic ...

IEEE Comp Soc1998

The GigaView multiprocessor multidisk image server

Roger Hersch

Professionals in various fields such as medical imaging, biology, and civil engineering require rapid access to huge amounts of pixmap image data. Multimedia interfaces further increase the need for large image databases. To fulfil these requirements, the ...

Wiley1996

Tree polytope on 2-trees

Thomas Liebling, François Margot

We give a complete polyhedral characterization of the tree polytope (convex hull of the characteristic vectors of trees in the graph) on 2-trees. ...

1994

Orthogonal time-varying filter banks and wavelet packets

Martin Vetterli

Considers the construction of orthogonal time-varying filter banks. By examining the time domain description of the two-channel orthogonal filter bank the authors find it possible to construct a set of orthogonal boundary filters, which allows to apply the ...

1994

Multimedia performance behavior of the GigaView parallel image server

Roger Hersch

Multimedia interfaces increase the need for large image databases, supporting the capability of storing and fetching streams of data with strict synchronicity and isochronicity requirements. In order to fulfill these requirements, the GigaView parallel ima ...

IEEE Comput. Soc. Press1994

Parallel storage and retrieval of pixmap images

Roger Hersch

To fulfill the requirement of rapid access to huge amounts of uncompressed pixmap image data, a parallel image server architecture is proposed, based on arrays of intelligent disk nodes, with each disk node composed of one processor and one disk. It is sho ...

IEEE Comput. Soc. Press1993

Best wavelet packet bases in a rate-distortion sense

Martin Vetterli

A fast rate-distortion (R-D) optimal scheme for coding adaptive trees whose individual nodes spawn descendents forming a disjoint and complete basis cover for the space spanned by their parent nodes is presented. The scheme guarantees operation on the conv ...

1993

Distributing pixmap images among parallel disk arrays

Roger Hersch

Professionals in various fields such as medical imaging, biology and civil engineering require rapid access to huge amounts of pixmap image data. This paper fulfils these requirements by conceiving and developing an architecture integrating processing and ...

1993

Parallel pixmap image storage and retrieval

Roger Hersch

Professionals in various fields such as medical imaging, biology and civil engineering require rapid access to huge amounts of uncompressed pixmap image data. In order to fulfil these requirements, a parallel image server architecture is proposed, based on ...

IOS Press1993