Sciweavers

50 search results - page 2 / 10
» Simplex Distributions for Embedding Data Matrices over Time
Sort
View
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
11 years 6 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
FMSD
2006
140views more  FMSD 2006»
13 years 4 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
NIPS
2004
13 years 5 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
SIPS
2007
IEEE
13 years 10 months ago
Embedded Reconfigurable Solution for OFDM Detection Over Fast Fading Radio Channels
OFDM demodulation under fast fading radio channels is very computationally demanding, making the implementation of Software Defined Radio (SDR) solutions problematic. A suboptima...
Mihai Sima, Michael McGuire
IRREGULAR
1995
Springer
13 years 7 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...