Sciweavers

1536 search results - page 55 / 308
» Approximately Dominating Representatives
Sort
View
TIT
2002
65views more  TIT 2002»
14 years 11 months ago
On the importance of combining wavelet-based nonlinear approximation with coding strategies
This paper provides a mathematical analysis of transform compression in its relationship to linear and nonlinear approximation theory. Contrasting linear and nonlinear approximatio...
Albert Cohen, Ingrid Daubechies, Onur G. Guleryuz,...
PVLDB
2008
111views more  PVLDB 2008»
14 years 11 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
ATAL
2010
Springer
14 years 6 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
ICCAD
2008
IEEE
80views Hardware» more  ICCAD 2008»
15 years 8 months ago
Advancing supercomputer performance through interconnection topology synthesis
—In today’s many-core era, the interconnection networks have been the key factor that dominates the performance of a computer system. In this paper, we propose a design flow t...
Yi Zhu, Michael Taylor, Scott B. Baden, Chung-Kuan...
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 6 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger