1391 search results - page 170 / 279 » Optimally Sparse Frames |
145
click to vote
COMPUTING
2007
15 years 4 months ago
2007
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
139
Voted
EOR
2007
15 years 4 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
140
click to vote
AUTOMATICA
2005
15 years 4 months ago
2005
This paper presents a computational approach for the frequency-domain identification of multivariable, discrete-time transfer function models based on a cost function minimization...
146
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
161
click to vote
SODA
2010
ACM
15 years 3 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...