Sciweavers

187 search results - page 12 / 38
» Generic Graph Algorithms for Sparse Matrix Ordering
Sort
View
ICCCN
2007
IEEE
15 years 3 months ago
Interleaving Techniques for W-CDMA Linear Equalization Receivers
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
João Carlos Silva, Rui Dinis, Nuno Souto, F...
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 4 months ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...
ICPP
1993
IEEE
15 years 1 months ago
A Concurrent Dynamic Task Graph
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
Theodore Johnson
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 4 months ago
Kron Reduction of Graphs with Applications to Electrical Networks
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
Florian Dörfler, Francesco Bullo
ECML
2007
Springer
15 years 3 months ago
Stability Based Sparse LSI/PCA: Incorporating Feature Selection in LSI and PCA
The stability of sample based algorithms is a concept commonly used for parameter tuning and validity assessment. In this paper we focus on two well studied algorithms, LSI and PCA...
Dimitrios Mavroeidis, Michalis Vazirgiannis