381 search results - page 70 / 77 » Fraction-Free RNS Algorithms for Solving Linear Systems |
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
IJHPCA
2010
13 years 6 months ago
2010
Sparse matrix operations achieve only small fractions of peak CPU speeds because of the use of specialized, indexbased matrix representations, which degrade cache utilization by i...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
BIRTHDAY
2010
Springer
14 years 25 days ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
FLAIRS
1998
13 years 9 months ago
1998
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...