93 search results - page 7 / 19 » Improving Memory-System Performance of Sparse Matrix-Vector ... |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We propose an algorithm to improve the quality of depth-maps used for Multi-View Stereo (MVS). Many existing MVS techniques make use of a two stage approach which estimates depth-m...
ACSC
2004
IEEE
13 years 11 months ago
2004
IEEE
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
ISBI
2009
IEEE
14 years 2 months ago
2009
IEEE
The inverse problem with distributed dipoles models in M/EEG is strongly ill-posed requiring to set priors on the solution. Most common priors are based on a convenient ℓ2 norm....