Concept

B-tree

Related publications (104)

Reaching volumes generated by means of octal trees and Cartesian constraints

We present a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certain reach strategy. This information is stored in a data structure called volume approx ...

IEEE Comput. Soc2003

Computational Analysis of Mesh Simplification Using Global Error

Martin Vetterli, Thomas Liebling, Laurent Balmelli

Meshes with (recursive) subdivision connectivity, such as subdivision surfaces, are increasingly popular in computer graphics. They present several advantages over their Delaunay-type based counterparts, e.g., Triangulated Irregular Networks (TINs), such a ...

2003

Automated Parameterization and Patching of Bifurcating Vessels

Recent developments in computational modeling of human arteries have opened the possibility of performing subject-specific analyses on increasingly larger numbers of subjects. This achievement will eventually lead to a better understanding of the role of g ...

2003

Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks - the Static Case

Jean-Pierre Hubaux, Mark Felegyhazi, Levente Buttyan

In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packet forwarding in order to save its own resources. Some researchers have propose ...

2003

Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks - the Static Case (extended version)

Jean-Pierre Hubaux, Mark Felegyhazi, Levente Buttyan

2003

Monadic Queries over Tree-Structured Data

Christoph Koch

Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widespread database query problem in the context of XML. Partly a survey of recent wor ...

2002

Efficient Matchmaking and Directory Services

Boi Faltings, Ion Constantinescu

It has been widely recognised that matchmaking is an important component of heterogeneous multiagent systems. Several researchers have developed powerful techniques for the matchmaking problem in general. There are also specific representation of agent cap ...

Swiss Federal Institute of Technology (EPFL)2002

Mesh Optimization Using Global Error with Application to Geometry Simplification

Martin Vetterli, Thomas Liebling, Laurent Balmelli

Elsevier2002

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

Karl Aberer

Scalable mechanisms to support efficient key-based search in distributed systems are an important part of the infrastructure of peer-to-peer systems and global information systems. They received substantial attention both in information and communication s ...

2002

Ideal Hash Trees

Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash trees. Insert, search and delete times are small and constant, indep ...

2001

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.