Sciweavers

7 search results - page 1 / 2
» The discretized discrepancy principle under general source c...
Sort
View
JC
2006
61views more  JC 2006»
13 years 4 months ago
The discretized discrepancy principle under general source conditions
We discuss adaptive strategies for choosing regularization parameters in TikhonovPhillips regularization of discretized linear operator equations. Two rules turn out to be entirel...
Peter Mathé, Sergei V. Pereverzev
CORR
2008
Springer
173views Education» more  CORR 2008»
13 years 5 months ago
Decomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
In this paper, we propose a general cross-layer optimization framework in which we explicitly consider both the heterogeneous and dynamically changing characteristics of delay-sens...
Fangwen Fu, Mihaela van der Schaar
CORR
2007
Springer
97views Education» more  CORR 2007»
13 years 4 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi
TIT
2010
138views Education» more  TIT 2010»
12 years 11 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
JCST
2006
65views more  JCST 2006»
13 years 4 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos