Sciweavers

1209 search results - page 22 / 242
» Approximation by pseudo-linear operators
Sort
View
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
15 years 11 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
103
Voted
EWSN
2010
Springer
15 years 5 months ago
Energy-Aware Sparse Approximation Technique (EAST) for Rechargeable Wireless Sensor Networks
Due to non-homogeneous spread of sunlight, sensing nodes typically have non-uniform energy profiles in rechargeable Wireless Sensor Networks (WSNs). An energy-aware work load dist...
Rajib Kumar Rana, Wen Hu, Chun Tung Chou
MFCS
2005
Springer
15 years 3 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
80
Voted
FAST
2007
14 years 11 months ago
//TRACE: Parallel Trace Replay with Approximate Causal Events
//TRACE1 is a new approach for extracting and replaying traces of parallel applications to recreate their I/O behavior. Its tracing engine automatically discovers inter-node data ...
Michael P. Mesnier, Matthew Wachs, Raja R. Sambasi...
69
Voted
CORR
2008
Springer
76views Education» more  CORR 2008»
14 years 10 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher