A FFINITY: Efficiently Querying Statistical Measures on Time-Series Data
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Conventional data warehouses employ the query-at-a-time model, which maps each query to a distinct physical plan. When several queries execute concurrently, this model introduces contention, because the physical plans—unaware of each other—compete for acce ...
The characteristic of effective properties of physical processes in heterogeneous media is a basic modeling and computational problem for many applications. As standard numerical discretization of such multiscale problems (e.g. with classical finite elemen ...
The objective of this work is to develop a numerical framework to perform rapid and reliable simulations for solving parametric problems in domains represented by networks and to extend the classical reduced basis method. Aimed at this scope, we propose tw ...
Shape Optimization problems governed by partial differential equations result from many applications in computational fluid dynamics; they involve the repetitive evaluation of outputs expressed as functionals of the field variables and usually imply big co ...
In conventional programming languages like Java, the interface for accessing databases is often inelegant. Typically, an entire separate database query language must be embedded inside a conventional programming language for programmers to access the full ...
The solution of inverse problems in cardiovascular mathematics is computationally expensive. In this paper we apply a domain parametrization technique to reduce both the geometrical and computational complexity of the forward problem, and replace the finit ...
Computing statistical measures for large databases of time series is a fundamental primitive for querying and mining time-series data [1–6]. This primitive is gaining importance with the increasing number and rapid growth of time series databases. In this ...
As data collections become larger and larger, data loading evolves to a major bottleneck. Many applications already avoid using database systems, e.g., scientific data analysis and social networks, due to the complexity and the increased data-to-query time ...
The recent availability of geospatial information as linked open data has generated new interest in geospatial query processing and reasoning, a topic with a long tradition of research in the areas of databases and artificial intelligence. In this paper we ...
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e.g. datalog rules) can fire probabilistically. We define two possible semantic ...
