1068 search results - page 67 / 214 » Factorization as a Rank 1 Problem |
110
click to vote
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
The problem of reliable communication over unknown frequency-selective block-fading channels with sparse impulse responses is considered. In particular, discrete-time impulse respo...