Publications associées à R-arbre

Root carbon and nutrient homeostasis determines downy oak sapling survival and recovery from drought

The role of carbon (C) and nutrient uptake, allocation, storage and especially their interactions in survival and recovery of trees under increased frequencies and intensities of drought events is not well understood. A full factorial experiment with four ...

2021

Modelling the Syntax of North Indian Melodies with a Generalized Graph Grammar

Martin Alois Rohrmeier, Christoph Finkensiep

Hierarchical models of music allow explanation of highly complex musical structure based on the general principle of recursive elaboration and a small set of orthogonal operations. Recent approaches to melodic elaboration have converged to a representation ...

ISMIR2019

HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces

Akhil Arora, Arnab Bhattacharya, Piyush Kumar

Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary to practically solve the problem of nearest neighbor search. In this pap ...

ASSOC COMPUTING MACHINERY2018

GPU Rasterization for Real-Time Spatial Aggregation over Arbitrary Polygons

Anastasia Ailamaki, Eleni Tzirita Zacharatou

Visual exploration of spatial data relies heavily on spatial aggregation queries that slice and summarize the data over different regions. These queries comprise computationally-intensive point-in-polygon tests that associate data points to polygonal regio ...

VLDB Endowment Inc.2017

Integrating models across temporal and spatial scales to simulate landscape patterns and dynamics in mountain pasture-woodlands

Alexander Ludwig Johannes Peringer

Context Pasture-woodlands are semi-natural landscapes that result from the combined influences of climate, management, and intrinsic vegetation dynamics. These landscapes are sensitive to future changes in land use and climate, but our ability to predict t ...

Springer2017

Scaling Similarity Joins over Tree-Structured Data

Given a large collection of tree-structured objects (e.g., XML documents), the similarity join finds the pairs of objects that are similar to each other, based on a similarity threshold and a tree edit distance measure. The state-of-the-art similarity join ...

Assoc Computing Machinery2015

Approximation methods for large-scale spatial queueing systems

Nikolaos Geroliminis, Burak Boyaci

Different than the conventional queueing systems, in spatial queueing systems (SQS) the service rate for each customer-server pairs differs and the server that intervenes for a specific customer is not known a priori, depending on the availability of serve ...

Pergamon-Elsevier Science Ltd2015

Accelerating Spatial Range Queries

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Alexandros Stougiannis

It is increasingly common for domain scientists to use computational tools to build and simulate spatial models of the phenomena they are studying. The spatial models they build are more and more detailed as well as dense and are consequently difficult to ...

2013

TOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented Partitioning

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Sadegh Heyrani Nobari

Efficient spatial joins are pivotal for many applications and particularly important for geographical information systems or for the simulation sciences where scientists work with spatial models. Past research has primarily focused on disk-based spatial jo ...

2013

GIPSY: Joining Spatial Datasets with Contrasting Density

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Mirjana Pavlovic

Many scientific and geographical applications rely on the efficient execution of spatial joins. Past research has produced several efficient spatial join approaches and while each of them can join two datasets, the problem of efficiently joining two datase ...

2013

Fast and shift-insensitive similarity comparisons of NMR using a tree-representation of spectra

Luc Patiny, Julien Wist

An efficient method to extract and store information from NMR spectra is proposed that is suitable for comparison and construction of a search engine. This method based on trees doesn't require any peak picking or any pre-treatment of the data and is found ...

Elsevier Science Bv2013

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

Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

Christos Dimitrakakis

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

Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

Christos Dimitrakakis

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