Sciweavers

714 search results - page 10 / 143
» An efficient algorithm for positive realizations
Sort
View
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 9 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
FM
2008
Springer
137views Formal Methods» more  FM 2008»
13 years 10 months ago
JML Runtime Assertion Checking: Improved Error Reporting and Efficiency Using Strong Validity
Abstract. The Java Modeling Language (JML) recently switched to an assertion semantics based on "strong validity" in which an assertion is taken to be valid precisely whe...
Patrice Chalin, Frédéric Rioux
AICCSA
2006
IEEE
168views Hardware» more  AICCSA 2006»
14 years 2 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
IC3
2009
13 years 6 months ago
Energy Efficiency of Thermal-Aware Job Scheduling Algorithms under Various Cooling Models
One proposed technique to reduce energy consumption of data centers is thermal-aware job scheduling, i.e. job scheduling that relies on predictive thermal models to select among po...
Georgios Varsamopoulos, Ayan Banerjee, Sandeep K. ...
CCR
2008
94views more  CCR 2008»
13 years 8 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...