Sciweavers

1649 search results - page 37 / 330
» Improved Matrix Interpretation
Sort
View
ICCS
2005
Springer
15 years 6 months ago
Vectorized Sparse Matrix Multiply for Compressed Row Storage Format
Abstract. The innovation of this work is a simple vectorizable algorithm for performing sparse matrix vector multiply in compressed sparse row (CSR) storage format. Unlike the vect...
Eduardo F. D'Azevedo, Mark R. Fahey, Richard Tran ...
FPL
2004
Springer
74views Hardware» more  FPL 2004»
15 years 6 months ago
Hardware/Software Implementation of FPGA-Targeted Matrix-Oriented SAT Solvers
The paper describes two methods for the design of matrix-oriented SAT solvers based on data compression. The first one provides matrix compression in a host computer and decompress...
Valery Sklyarov, Iouliia Skliarova, Bruno Figueire...
IRREGULAR
1995
Springer
15 years 4 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...
89
Voted
EMNLP
2007
15 years 2 months ago
Structured Prediction Models via the Matrix-Tree Theorem
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
Terry Koo, Amir Globerson, Xavier Carreras, Michae...
76
Voted
EOR
2006
70views more  EOR 2006»
15 years 16 days ago
Heuristics for matrix bandwidth reduction
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
Andrew Lim, Brian Rodrigues, Fei Xiao