2609 search results - page 264 / 522 » Optimizing for parallelism and data locality |
207
click to vote
SCIA
2009
Springer
16 years 1 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
164
click to vote
ICAPR
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. This contribution shows how unsupervised Markovian segmentation techniques can be accelerated when implemented on graphics hardware equipped with a Graphics Processing Un...
175
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we describe an algorithm and implementation of locality optimizations for architectures with instruction sets such as Intel’s SSE and Motorola’s AltiVec that su...
201
click to vote
TKDE
2002
15 years 6 months ago
2002
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
205
click to vote
LCTRTS
2007
Springer
16 years 24 days ago
2007
Springer
Set-associative caches are traditionally managed using hardwarebased lookup and replacement schemes that have high energy overheads. Ideally, the caching strategy should be tailor...