Time- and Space-Efficient Sliding Window Top-k Query Processing
Publications associées (32)
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.
In standard database scenarios, an end-user assumes that all data (e.g., sensor readings) is stored in a database. Therefore, one can simply submit any arbitrary complex processing in the form of SQL queries or stored procedures to a database server. Data ...
The Vehicle Routing Problem with Time Windows consists of computing a minimum cost set of routes for a fleet of vehicles of limited capacity visiting a given set of customers with known demand, with the additional constraint that each customer must be visi ...
The chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in tim ...
BioMed Central2010
, , ,
We consider sliding window query execution scheduling in stream processing engines. Sliding windows are an essential building block to limit the query focus at a particular part of the stream, based either on value count or time ranges. These so called sli ...
IEEE Computer Society2009
The complexity of processes occurring in the brain is an intriguing issue not just for scientists and medical doctors, but the humanity in general. The cortex ability to perceive and analyze an enormous amount of information in an instance of time, the par ...
The Vehicle Routing Problem with Soft Time Windows consists in computing a minimum cost set of routes for a fleet of vehicles of limited capacity that must visit a given set of customers with known demand, with the additional feature that each customer exp ...
This paper proposes and validates a daylighting design sequence for sidelit spaces. Since the design sequence uses the daylight factor as a performance metric, it is aimed towards spaces that primarily receive diffuse daylight. It should be complemented by ...
Physical or virtual models are commonly employed to visualize the conceptual ideas of architects, lighting designers and daylighting researchers. The models are also used to assess the daylighting performance of their buildings, particularly when Complex F ...
EPFL2008
, ,
We address the problem of joint optimal rate allocation and scheduling between media source rate and error protection rate in scalable streaming applications over lossy multipath networks. Starting from a distortion representation of the received media inf ...
Institute of Electrical and Electronics Engineers2009
This paper proposes an interactive goal-based method for designing day lit buildings. The lighting simulation tool which supports this process is a hybrid global illumination rendering method which efficiently computes annual daylighting metrics. The goal- ...
