Sciweavers

6660 search results - page 282 / 1332
» Data Analysis for Query Processing
Sort
View
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 9 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
IS
2011
15 years 1 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
IS
2011
14 years 10 months ago
Collection trees for event-monitoring queries
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Antonios Deligiannakis, Yannis Kotidis, Vassilis S...
TC
1998
15 years 6 months ago
Accuracy vs. Precision in Digital VLSI Architectures for Signal Processing
—The paper provides a sensitivity analysis to measure the loss in accuracy induced by perturbations affecting acyclic computational flows composed of linear convolutions and nonl...
Cesare Alippi, Luciano Briozzo
BMCBI
2011
14 years 10 months ago
A Simple Approach to Ranking Differentially Expressed Gene Expression Time Courses through Gaussian Process Regression
Background: The analysis of gene expression from time series underpins many biological studies. Two basic forms of analysis recur for data of this type: removing inactive (quiet) ...
Alfredo A. Kalaitzis, Neil D. Lawrence