Sciweavers

118 search results - page 17 / 24
» Greedy algorithms for on-line set-covering and related probl...
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
A hybrid compressed sensing algorithm for sparse channel estimation in MIMO OFDM systems
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
Chenhao Qi, Lenan Wu
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
15 years 3 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
ICDE
2011
IEEE
273views Database» more  ICDE 2011»
14 years 1 months ago
Shortcut selection in RDF databases
—An increasing amount of data produced nowadays is in RDF format. While significant work has been performed on view selection and query optimization algorithms in relational dat...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
15 years 3 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
ICPP
2005
IEEE
15 years 3 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal